On an equivalence of system-theoretical and categorical concepts
On certain codes admitting inverse semigroups as syntactic monoids.
On classification, logical educational materials, categories, and automata
On closure operators on monoids
On codes having no finite completion
On coding morphisms for zigzag codes
On context-free rewriting with a simple restriction and its computational completeness
This paper discusses context-free rewriting systems in which there exist two disjoint finite sets of rules, and a symbol, referred to as a condition of applicability, is attached to each rule in either of these two sets. In one set, a rule with a symbol attached to it is applicable if the attached symbol occurs in the current rewritten string while in the other set, such a rule is applicable if the attached symbol does not occur there. The present paper demonstrates that these rewriting systems...
On Continued Fractions and Finite Automata.
On continuous functions computed by finite automata
On decidability of skeletal sets [Abstract of thesis]
On differentiation functions, structure functions, and related languages of context-free grammars
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
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
On DOS languages and DOS mappings.
On dot-depth two
On equality sets of morphisms in topological free monoids
On equivalence of two tests for codes.
On families recognizable by finite branching automata
On free inverse monoid languages
On frontiers of regular trees