Results 1 - 10 of 57,348

In the prehistory of formal language theory: Gauss

by Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa
"... The problem proposed by Gauss of characterizing the code of a simple crossing closed curve (SCCC, for short) can be considered a formal language question. We define three related infinite languages. Two of them are regular; the type of the third is an open problem. 1 Gauss codes The origin of formal ..."
Abstract - Add to MetaCart
of formal language theory is usually considered (see [12]) to be the Thue paper [13] but, as it is pointed out in [5], one can identify formal language theory problems even in [7]; the topic, known in combinatorics under the name of Langford strings [3], raises challenging formal language theory problems

Formal Language Theory and Biological Macromolecules

by David B. Searls, Bioinformatics Group, Smithkline Beecham Pharmaceuticals - Series in Discrete Mathematics and Theoretical Computer Science , 1999
"... Biological macromolecules can be viewed, at one level, as strings of symbols. Collections of such molecules can thus be considered to be sets of strings, i.e. formal languages. This article reviews languagetheoretic approaches to describing intramolecular and intermolecular structural interactions w ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
within these molecules, and evolutionary relationships between them. 1 Introduction The author has for some time been investigating the application of formal language theory to biological macromolecules, primarily nucleic acids because of the relative simplicity of the biochemical structures

Notes on Formal Language Theory and Parsing

by James Power , 1999
"... Contents 1 REGULAR LANGUAGES 1 1.1 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Non-Deterministic Finite-State Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2.1 Converting a regular expressi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Contents 1 REGULAR LANGUAGES 1 1.1 Regular Expressions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Non-Deterministic Finite-State Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2.1 Converting a regular

Taxonomy of xml schema languages using formal language theory

by Makoto Murata, Dongwon Lee, Murali Mani - EXTREME MARKUP LANGUAGES , 2001
"... On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, ..."
Abstract - Cited by 234 (6 self) - Add to MetaCart
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local

The Control System in Formal Language Theory and

by Spécialité Systèmes Informatiques, Zhe Chen, Examinateur Jean-paul, Blanquart Astrium, European Aeronautic Defence
"... présentée à l’Institut National des Sciences Appliquées de Toulouse pour l’obtention du titre de DOCTEUR de l’Universite ́ de Toulouse délivre ́ par l’INSA ..."
Abstract - Add to MetaCart
présentée à l’Institut National des Sciences Appliquées de Toulouse pour l’obtention du titre de DOCTEUR de l’Universite ́ de Toulouse délivre ́ par l’INSA

M.: New language operations in formal language theory

by Alexander Meduna, Martin Vítek - Schedae Informaticae
"... Abstract. Stringology represents a modern part of the formal language theory, which deals with strings, languages and operations on them. It introduces many new language operations, which can be divided into two groups – insertion and deletion operations. Some of these operations are described in [1 ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Stringology represents a modern part of the formal language theory, which deals with strings, languages and operations on them. It introduces many new language operations, which can be divided into two groups – insertion and deletion operations. Some of these operations are described

Formal Language Theory for Natural Language Processing

by Shuly Wintner Computer, Shuly Wintner , 2002
"... This paper reports on a course whose aim is to introduce Formal Language Theory to students with little formal background (mostly linguistics students). The course was first taught at the European Summer School for Logic, Language and Information to a mixed audience of students, undergraduate ..."
Abstract - Add to MetaCart
This paper reports on a course whose aim is to introduce Formal Language Theory to students with little formal background (mostly linguistics students). The course was first taught at the European Summer School for Logic, Language and Information to a mixed audience of students

Digraph Complexity Measures and Applications in Formal Language Theory

by Hermann Gruber
"... Abstract. We give an overview of some structural complexity measures and width parameters on digraphs, relate them to each other, and discuss their computational complexity aspects. Particular attention is given to cycle rank, perhaps the oldest of these measures to be studied in the literature, whi ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
, which turns out to be intimately related to structural and descriptional complexity aspects of regular expressions. Some new results on cycle rank thus have immediate implications in formal language theory. 1

Finiteness conditions on subgroups and formal language theory

by Christiane Frougny, Jacques Sakarovitch, Paul Schupp - Proc. London Math. Soc , 1989
"... Dedicated to the memory of W. W. Boone We show in this article that the most usual finiteness conditions on a subgroup of a finitely generated group all have equivalent formulations in terms of formal language theory. This correspondence gives simple proofs of various theorems concerning intersectio ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Dedicated to the memory of W. W. Boone We show in this article that the most usual finiteness conditions on a subgroup of a finitely generated group all have equivalent formulations in terms of formal language theory. This correspondence gives simple proofs of various theorems concerning

Concepts and Types – An Application to Formal Language Theory

by Christian Wurm, Universität Bielefeld
"... Abstract. We investigate how formal concept analysis can be applied in a type-theoretic context, namely the context of λ-terms typed à la Curry. We first show some general results, which reveal that concept lattices generally respect and reflect the type structure of terms. Then, we show an applicat ..."
Abstract - Add to MetaCart
an application of the results in formal language theory, where we vastly generalize existing approaches of capturing the distributional structure of languages by means of formal concept analysis. So type theory is interesting to formal concept analysis not only as a particular context, but also because it allows
Results 1 - 10 of 57,348