Article
Licensed
Unlicensed
Requires Authentication
On special properties of a composition of automata
-
A. V. Babash
Published/Copyright:
October 1, 2003
We suggest algorithms for constructing models of a finite automaton which are new automata such that the equations describing the functioning of these models are consequences of the equations describing the functioning of the initial automaton. These new automata are constructed with the use of powers of the initial automaton and some additional functions on the output words. Applications of the results are related to the problem on determining the state of an automaton on the base of the input sequences and the corresponding output sequences.
Published Online: 2003-10-01
Published in Print: 2003-10-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
