On continuous functions computed by finite automata
Displaying 21 – 40 of 142
On decidability of skeletal sets [Abstract of thesis]
Nguyen Xuang Dung (1990)
Commentationes Mathematicae Universitatis Carolinae
On differentiation functions, structure functions, and related languages of context-free grammars
Jürgen Dassow, Victor Mitrana, Gheorghe Păun, Ralf Stiebe (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We introduce the notion of a differentiation function of a context-free grammar which gives the number of terminal words that can be derived in a certain number of steps. A grammar is called narrow (or -narrow) iff its differentiation function is bounded by a constant (by ). We present the basic properties of differentiation functions, especially we relate them to structure function of context-free languages and narrow grammars to slender languages. We discuss the decidability of the equivalence...
On differentiation functions, structure functions, and related languages of context-free grammars
Jürgen Dassow, Victor Mitrana, Gheorghe Păun, Ralf Stiebe (2010)
RAIRO - Theoretical Informatics and Applications
We introduce the notion of a differentiation function of a context-free grammar which gives the number of terminal words that can be derived in a certain number of steps. A grammar is called narrow (or k-narrow) iff its differentiation function is bounded by a constant (by k). We present the basic properties of differentiation functions, especially we relate them to structure function of context-free languages and narrow grammars to slender languages. We discuss the decidability of ...
On directable automata
Ján Černý, Alica Pirická, Blanka Rosenauerová (1971)
Kybernetika
On DOS languages and DOS mappings.
A. Ehrenfeucht, G. Rozenberg, D. Haussler, P. Zeiger (1984)
Semigroup forum
On dot-depth two
F. Blanchet-Sadri (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On equality sets of morphisms in topological free monoids
Wit Foryś (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On equivalence of two tests for codes.
Falucskai, J. (2008)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
On families recognizable by finite branching automata
Václav Benda, Kamila Bendová (1977)
Kybernetika
On free inverse monoid languages
Pedro V. Silva (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On frontiers of regular trees
Wolfgang Thomas (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On -machines generating intersection and union of generable languages
Ivan Mezník (1975)
Kybernetika
On geometric automata which can nondeterministically choose auxiliary points
Ulrich Huckenbeck (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On graph products of automatic monoids
A. Veloso Da Costa (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
On graph products of automatic monoids
A. Veloso da Costa (2010)
RAIRO - Theoretical Informatics and Applications
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
On hierarchy of the positioned eco-grammar systems
Miroslav Langer (2014)
Kybernetika
Positioned eco-grammar systems (PEG systems, for short) were introduced in our previous papers. In this paper we engage in a new field of research, the hierarchy of PEG systems, namely in the hierarchy of the PEG systems according to the number of agents presented in the environment and according to the number of types of agents in the system.
On infinitary finite length codes
Ludwig Staiger (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On infinite real trace rational languages of maximum topological complexity.
Finkel, O., Ressayre, J.-P., Simonnet, P. (2004)
Zapiski Nauchnykh Seminarov POMI
On languages linearly grammatizable by means of derivatives
Milan Drášil (1986)
Archivum Mathematicum