The article explores the features of electronic document management technical documentation railway automation and telemechanics. A block diagram an automaton model is developed. proposed a formalized consists matrices external microoperations, internal code creation for following microcomponents. number states firmware completely determined by logic elements algorithms. size depends on operato...

We introduce two series of finite automata starting from the socalled Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the free product of groups of order 2. Furthermore, these properties are shared by disjoint unions of any number of distinct automata from either series.

In this paper we propose two optimization techniques for resource modelling in software pipelining. The first technique is the extension of our grouping technique to reduce the space overhead in automaton based software pipelining methods. This technique exploits the symmetry in the states of the automaton to produce the Group Automaton (GA) with reduced number of states. Our second technique i...

Abstract We show the decidability of finite sequentiality problem for unambiguous max-plus tree automata. A automaton is called if there at most one accepting run on every tree. The asks whether a given automaton, exist finitely many deterministic automata whose pointwise maximum equivalent to automaton.

Let A be a finite alphabet and let L ⊂ (A∗)n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of t...

Let A be a finite alphabet and let L ⊂ (A∗)n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of t...

Groups and semigroups generated by Mealy automata were formally introduced in the early sixties. They revealed their full potential over the years, by contributing to important conjectures in group theory. In the current chapter, we intend to provide various combinatorial and dynamical tools to tackle some decision problems all related to some extent to the growth of automaton (semi)groups. In ...