Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the number of finite automata stabilized at a fixed state by a constant input
-
E. V. SHERISHEVA
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1994
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Lower cardinality-based estimates for the complexity of realization of functions from Pkby circuits of functional elements over an arbitrary basis
- On some closed classes in partial two-valued logic
- On realization of partitions of sets by circuits of functional elements
- Coverings of Boolean graphs
- On the minimax path in a network
- Properties of matrices over a commutative ring related to the similarity relation
- Lower bounds for sums of characters over finite fields
- On the number of finite automata stabilized at a fixed state by a constant input
- Ergodicity of conservative communication networks
Artikel in diesem Heft
- Lower cardinality-based estimates for the complexity of realization of functions from Pkby circuits of functional elements over an arbitrary basis
- On some closed classes in partial two-valued logic
- On realization of partitions of sets by circuits of functional elements
- Coverings of Boolean graphs
- On the minimax path in a network
- Properties of matrices over a commutative ring related to the similarity relation
- Lower bounds for sums of characters over finite fields
- On the number of finite automata stabilized at a fixed state by a constant input
- Ergodicity of conservative communication networks