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[1-5]. An example of an approved patent with claims on a series of 4-anilino-3-quinolinecarbonitriles-based chemical structures for the

2. Formal languages

-Purpose and Application-Based Systems realtime and embedded systems, smartcards; D.2.4 [Software Engineering]: Software/Program Verification formal methods; model checking; D.2.11 [Software Engineering]: Software Architectures domain-specific architectures; languages (e.g., description, interconnection,

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 context-sensitive languages.

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

Why should Formal Language specialists get interested and involved in the area of Grammar Induction (GI), likewise known as Grammatical Inference? This is the question we try to answer in this paper. To keep this paper short, we mostly refrain from giving technical details but rather cite according

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

-theoretic interpretation and proof of a key theorem of Chomsky and Schützenberger from formal language theory. 1.

. 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

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