| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436182 | Theoretical Computer Science | 2007 | 12 Pages |
Abstract
We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Černý’s construction.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
