Results 1  10
of
23,607
Formal Languages
, 1973
"... Close to 30 percent of all patents are chemical patents, of which roughly 10 percent claim IP rights over novel chemical structures using the Markush notation[15]. An example of an approved patent with claims on a series of 4anilino3quinolinecarbonitrilesbased chemical structures for the ..."
Abstract

Cited by 574 (41 self)
 Add to MetaCart
Close to 30 percent of all patents are chemical patents, of which roughly 10 percent claim IP rights over novel chemical structures using the Markush notation[15]. An example of an approved patent with claims on a series of 4anilino3quinolinecarbonitrilesbased chemical structures for the
Heyting Algebras and Formal Languages
"... Abstract: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of languages are closed under this exponentiation, e. g., the families of regular and of contextsensitive languages. ..."
Abstract
 Add to MetaCart
Abstract: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of languages are closed under this exponentiation, e. g., the families of regular and of contextsensitive languages.
Analogy and Formal Languages
 In Proceedings of FG/MOL 2001
, 2001
"... In this paper, we advocate a study of analogies between strings of symbols for their own sake. We show how some sets of strings, i.e., some formal languages, may be characterized by use of analogies. We argue that some preliminary \good properties" obtained may plead in favour of the use of ana ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
In this paper, we advocate a study of analogies between strings of symbols for their own sake. We show how some sets of strings, i.e., some formal languages, may be characterized by use of analogies. We argue that some preliminary \good properties" obtained may plead in favour of the use
Automata and Formal Languages
, 2003
"... This article provides an introduction to the theory of automata and formal languages. The elements are presented in a historical perspective and the links with other areas are underlined. In particular, applications of the field to linguistics, software design, text processing, computational alg ..."
Abstract
 Add to MetaCart
This article provides an introduction to the theory of automata and formal languages. The elements are presented in a historical perspective and the links with other areas are underlined. In particular, applications of the field to linguistics, software design, text processing, computational
Formal languages and groups as memory
, 2006
"... Abstract. We present an exposition of the theory of Mautomata and Gautomata, or finite automata augmented with a multiplyonly register storing an element of a given monoid or group. Included are a number of new results of a foundational nature. We illustrate our techniques with a grouptheoretic ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
theoretic interpretation and proof of a key theorem of Chomsky and Schützenberger from formal language theory. 1.
Number Theory And Formal Languages
 Emerging Applications of Number Theory, IMA Volumes in Mathematics and Applications
, 1999
"... . I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in finite characteristic, automatic real numbers, fixed points of homomorp ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. I survey some of the connections between formal languages and number theory. Topics discussed include applications of representation in base k, representation by sums of Fibonacci numbers, automatic sequences, transcendence in finite characteristic, automatic real numbers, fixed points
Harmonic Grammars for Formal Languages
"... Basic connectionist principles imply that grammars should take the form of systems of parallel soft constraints defining an optimization problem the solutions to which are the wellformed structures in the language. Such Harmonic Grammars have been successfully applied to a number of problems in the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
in the theory of natural languages. Here it is shown that formal languages too can be specified by Harmonic Grammars, rather than by conventional serial rewrite rule systems.
Enumeration of Formal Languages
"... We survey recent results on the enumeration of formal languages. In particular, we consider enumeration of regular languages accepted by deterministic and nondeterministic finite automata with n states, regular languages generated by regular expressions of a fixed length, and ωregular languages acc ..."
Abstract
 Add to MetaCart
We survey recent results on the enumeration of formal languages. In particular, we consider enumeration of regular languages accepted by deterministic and nondeterministic finite automata with n states, regular languages generated by regular expressions of a fixed length, and ωregular languages
Fractals, Dimension, And Formal Languages
"... We consider classes of sets of radic expansions of reals specified by means of the theory of formal languages or automata theory. It is shown how these specifications are used to calculate the Hausdorff dimension and Hausdorff measure of such sets. Since the appearence of Mandelbrot's 11 ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We consider classes of sets of radic expansions of reals specified by means of the theory of formal languages or automata theory. It is shown how these specifications are used to calculate the Hausdorff dimension and Hausdorff measure of such sets. Since the appearence of Mandelbrot's 11
Results 1  10
of
23,607