On -machines generating intersection and union of generable languages
On geometric automata which can nondeterministically choose auxiliary points
On graph products of automatic monoids
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
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
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
On infinite real trace rational languages of maximum topological complexity.
On languages linearly grammatizable by means of derivatives
On languages satisfying “interchange Lemma”
On languages satisfying Ogden's lemma
On limits in complete semirings.
On lindenmayerian rational subsets of monoids
On minimal realizations of behavior maps in categorial automata theory
On morphically generated formal power series
On multiplicatively dependent linear numeration systems, and periodic points
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
On multiplicatively dependent linear numeration systems, and periodic points
Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers β and γ respectively, such that β and γ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.
On networks of non-deterministic automata
On one definition of grammatical categories
On one language with connection to determinism and bounded deleting
On parallel deletions applied to a word