| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426274 | Information and Computation | 2008 | 7 Pages |
Abstract
For each integer n⩾8, we construct an n-state synchronizing automation with a zero state and only 2 input letters such that the minimum length of reset words for the automaton is .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
