Name
Abstract | ||
|---|---|---|
We follow language theoretic approach to synchronizing automata and \v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a strict connection between principal left ideals and synchronizing automata. We characterize regular languages whose minimal deterministic finite automaton is synchronizing and possesses a reset word belonging to the recognized language. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Quantum finite automata,Discrete mathematics,Combinatorics,Nondeterministic finite automaton,Nested word,Computer science,Deterministic finite automaton,Automaton,Synchronizing,Regular language,Principal ideal |
DocType | Volume | Citations |
Conference | abs/1412.6767 | 1 |
PageRank | References | Authors |
0.36 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marina I. Maslennikova | 1 | 18 | 2.94 |
| Emanuele Rodaro | 2 | 55 | 15.63 |