Rational series and their languages
Rational series and their languages
On synchronizing unambiguous automata
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Sur un Cas Particulier de la Conjecture de Cerny
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
On a conjecture by Carpi and D'Alessandro
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The averaging trick and the Černý conjecture
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An algorithm for road coloring
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The synchronization problem is investigated for a new class of deterministic automata called strongly transitive. An extension to unambiguous automata is also considered.