The Magic Number Problem for Subregular Language Families

We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified. We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist. For finite languages we obtain some partial results showing that certain numbers are non-magic.Comment: In Proceedings DCFS 2010, arXiv:1008.127

State Complexity of Reversals of Deterministic Finite Automata with Output

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has $n$ states and $k$ possible output values, there is a known upper bound of $k^n$ for the state complexity of reversal. We show this bound can be reached with a ternary input alphabet. We conjecture it cannot be reached with a binary input alphabet except when $k = 2$, and give a lower bound for the case $3 \le k < n$. We prove that the state complexity of reversal depends solely on the transition monoid of the DFAO and the mapping that assigns output values to states.Comment: 18 pages, 3 tables. Added missing affiliation/funding informatio

Quotient Complexity of Regular Languages

The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quotients of the language, and to call it "quotient complexity". The problem of finding the quotient complexity of a language f(K,L) is considered, where K and L are regular languages and f is a regular operation, for example, union or concatenation. Since quotients can be represented by derivatives, one can find a formula for the typical quotient of f(K,L) in terms of the quotients of K and L. To obtain an upper bound on the number of quotients of f(K,L) all one has to do is count how many such quotients are possible, and this makes automaton constructions unnecessary. The advantages of this point of view are illustrated by many examples. Moreover, new general observations are presented to help in the estimation of the upper bounds on quotient complexity of regular operations

The hieroglyphic Monad of Dr John Dee as a synthesis of late renaissance European thought

John Dee’s Monas Hieroglyphica presents his universal symbol of knowledge and explains some of the secrets contained within. A fundamental assumption of such a symbol is an underlying oneness of reality and of knowledge in which everything can be shown to be interrelated. In producing his symbols Dee combines a number of disparate topics in a way that seems impossible to modern readers but was considered only natural by his contemporaries. Thus, in this thesis I examine the manner in which this important aspect of Renaissance thought can be illuminated through a study of the Monas Hieroglyphica

Optimization Aspects of Carcinogenesis

Any process in which competing solutions replicate with errors and numbers of their copies depend on their respective fitnesses is the evolutionary optimization process. As during carcinogenesis mutated genomes replicate according to their respective qualities, carcinogenesis obviously qualifies as the evolutionary optimization process and conforms to common mathematical basis. The optimization view accents statistical nature of carcinogenesis proposing that during it the crucial role is actually played by the allocation of trials. Optimal allocation of trials requires reliable schemas' fitnesses estimations which necessitate appropriate, fitness landscape dependent, statistics of population. In the spirit of the applied conceptual framework, features which are known to decrease efficiency of any evolutionary optimization procedure (or inhibit it completely) are anticipated as "therapies" and reviewed. Strict adherence to the evolutionary optimization framework leads us to some counterintuitive implications which are, however, in agreement with recent experimental findings, such as sometimes observed more aggressive and malignant growth of therapy surviving cancer cells

Verse as a semiotic system

Poetry is an important challenge for semiotics, and a special area of study for the Tartu-Moscow semiotic school, since the first volume of Sign Systems Studies was Juri Lotman’s monograph Lectures on Structural Poetics (1964). From then on the concept of poetry as one of the secondary modelling systems has evolved, since in relation to poetry, the primary modelling system is natural language. In this paper, the concept of semiotic system has been re-examined and the treatment of primary and secondary semiotic systems has been significantly revised. A semiotic system can be characterized not only by its internal structure and other systems to which it is related, but also by the field upon what it is realized. The latter aspect has gained almost no attention in any treatment of semiotics; the execution of a sign is understood in the spirit of Saussure and Hjelmslev as a material realization of an abstract element (for instance, a chess piece knight can be realized with wood or plastic, but it can also remain purely virtual). At first, distinction is made between language and sign system. Every sign system consists of language and field. There are three different kinds of fields: 1) just a background – footprints on sand are a sign on the background of sand; 2) a material structured field (a football ground or a chess board in the game called Chapayev) and 3) an abstract structured field, which in its turn consists of other fields (for instance, the chess board which consists of 64 fields). Differently from a football ground, a chess board can be a purely virtual one on which virtual pieces are moved (for instance, in case of blindfold or correspondence chess). The field in its turn can be language and one language can use another language as its field. In this case we speak of primary and secondary sign systems. For instance, the prosodic system of language is a field for a verse metre, while the semantic system of language is a field for a narrative

Overlap-Free Words and Generalizations

The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used to solve some longstanding open problems in algebra and has remarkable connections to other areas of mathematics and computer science as well. This thesis will consider several different generalizations of Thue's work. In particular we shall study the properties of infinite words avoiding various types of repetitions. In Chapter 1 we introduce the theory of combinatorics on words. We present the basic definitions and give an historical survey of the area. In Chapter 2 we consider the work of Thue in more detail. We present various well-known properties of the Thue-Morse word and give some generalizations. We examine Fife's characterization of the infinite overlap-free words and give a simpler proof of this result. We also present some applications to transcendental number theory, generalizing a classical result of Mahler. In Chapter 3 we generalize a result of Seebold by showing that the only infinite 7/3-power-free binary words that can be obtained by iterating a morphism are the Thue-Morse word and its complement. In Chapter 4 we continue our study of overlap-free and 7/3-power-free words. We discuss the squares that can appear as subwords of these words. We also show that it is possible to construct infinite 7/3-power-free binary words containing infinitely many overlaps. In Chapter 5 we consider certain questions of language theory. In particular, we examine the context-freeness of the set of words containing overlaps. We show that over a three-letter alphabet, this set is not context-free, and over a two-letter alphabet, we show that this set cannot be unambiguously context-free. In Chapter 6 we construct infinite words over a four-letter alphabet that avoid squares in any arithmetic progression of odd difference. Our constructions are based on properties of the paperfolding words. We use these infinite words to construct non-repetitive tilings of the integer lattice. In Chapter 7 we consider approximate squares rather than squares. We give constructions of infinite words that avoid such approximate squares. In Chapter 8 we conclude the work and present some open problems