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
On permutations generated by infinite binary words.
On possible growths of arithmetical complexity
The arithmetical complexity of infinite words, defined by Avgustinovich, Fon-Der-Flaass and the author in 2000, is the number of words of length n which occur in the arithmetical subsequences of the infinite word. This is one of the modifications of the classical function of subword complexity, which is equal to the number of factors of the infinite word of length n. In this paper, we show that the orders of growth of the arithmetical complexity can behave as many sub-polynomial functions. More...
On racial insufficiency: White messengers cannot simulate coloured ones
On ranking 1-way finitely ambiguous NL languages and -complete census functions
On rational solution of the state equation of a finite automaton.
On real time and linear time cellular automata
On related transducers
On schemata and systems for parallel algorithms