| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437735 | Theoretical Computer Science | 2009 | 7 Pages |
Abstract
We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length where n is the number of states of the automaton.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
