A certain class of composite binary automata with strongly connected component automata is studied. Features as equivalence, reduction, and minimality of automata are considered. All quantities are expressed by simple properties of the component automata and the connecting network. This gives a powerful method to construct automata or generate binary sequences with certain prescribed properties
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
The problem about the synchronization of a finite deterministic automaton is not yet properly unders...
A certain class of composite binary automata with strongly connected component automata is studied. ...
The binary, periodic output sequence of a certain type of composite automaton is studied. Properties...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
AbstractWe already know how to decompose any finite automaton with a strongly connected state diagra...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
The output structure of certain composite automata is studied. The components are cyclic group-type ...
The composition of two arbitrary component automata can have deadlock states. A method is proposed t...
The structure of a strongly connected permutation automaton, a quasiperfect automaton, and a perfect...
AbstractDiverse problems ranging from many-valued logics to finite automata can be expressed as ques...
AbstractIn the theory of finite automata it is an important problem to characterize such systems of ...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
The problem about the synchronization of a finite deterministic automaton is not yet properly unders...
A certain class of composite binary automata with strongly connected component automata is studied. ...
The binary, periodic output sequence of a certain type of composite automaton is studied. Properties...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
AbstractWe already know how to decompose any finite automaton with a strongly connected state diagra...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
The output structure of certain composite automata is studied. The components are cyclic group-type ...
The composition of two arbitrary component automata can have deadlock states. A method is proposed t...
The structure of a strongly connected permutation automaton, a quasiperfect automaton, and a perfect...
AbstractDiverse problems ranging from many-valued logics to finite automata can be expressed as ques...
AbstractIn the theory of finite automata it is an important problem to characterize such systems of ...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
The problem about the synchronization of a finite deterministic automaton is not yet properly unders...
DOI
Add to ORKG