Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On automaton determinisation of sets of superwords
-
A. G. Verenikin
Veröffentlicht/Copyright:
1. Juli 2006
We introduce the concept of a determinising automaton which, for every superword taken from a given set fed into its input, beginning with some step, at any time t yields the value of the input word at time t + 1, that is, predicts the input superword. We find a criterion whether a given set of superwords is determinisable, that is, whether for the set there exists a determinising automaton. We give the best (in some sense) method to design a determinising automaton for an arbitrary determinisable set of superwords. For some determinisable sets we present optimal and asymptotically optimal determinising automata.
Published Online: 2006-07-01
Published in Print: 2006-07-01
Copyright 2006, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Estimates of the Cameron–Erdős constants
- Connection between Markov chains on finite simple groups and fundamental groups
- On automaton determinisation of sets of superwords
- Degeneracy bounds for private information retrieval protocols
- The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
- On the distribution of the number of ones in a Boolean Pascal's triangle
- On a number triangle
- On the critical Ω-foliated formations of finite groups
- Algebraic lattices of multiply Ω-foliated Fitting classes
- Properties of the lattice of all multiply Ω-canonical formations
Artikel in diesem Heft
- Estimates of the Cameron–Erdős constants
- Connection between Markov chains on finite simple groups and fundamental groups
- On automaton determinisation of sets of superwords
- Degeneracy bounds for private information retrieval protocols
- The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
- On the distribution of the number of ones in a Boolean Pascal's triangle
- On a number triangle
- On the critical Ω-foliated formations of finite groups
- Algebraic lattices of multiply Ω-foliated Fitting classes
- Properties of the lattice of all multiply Ω-canonical formations
