Name
Abstract | ||
|---|---|---|
In this paper, we establish the Cerny-Pin conjecture for automata with the property that their transition monoid cannot recognize the language {a, b}* ab{a, b}*. For the subclass of automata whose transition monoids have the property that each regular J-class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02737-6_5 | DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS |
DocType | Volume | ISSN |
Conference | 5583 | 0302-9743 |
Citations | PageRank | References |
3 | 0.43 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Almeida | 1 | 61 | 15.24 |
| Benjamin Steinberg | 2 | 14 | 3.00 |