Reset sequences for monotonic automata
SIAM Journal on Computing
Exact calculation of synchronization sequences based on binary decision diagrams
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Minimum length synchronizing sequences of finite state machine
DAC '93 Proceedings of the 30th international Design Automation Conference
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Composition sequences for functions over a finite domain
Theoretical Computer Science
Model Checking Based on Sequential ATPG
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
An algorithmic approach to the automated design of parts orienters
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Synchronizing and representation problems for sequential machines with masked outputs
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Establishing certain bounds concerning finite automata
Journal of Computer and System Sciences
Synchronizing automata preserving a chain of partial orders
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The mortality threshold for partially monotonic automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Finitely Generated Synchronizing Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On a conjecture by Carpi and D'Alessandro
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the hybrid Černý-road coloring problem and Hamiltonian paths
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of prefix, suffix, bifix and infix operators on regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Automata with extremal minimality conditions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The averaging trick and the Černý conjecture
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Slowly synchronizing automata and digraphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of finding reset words in finite automata
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximating minimum reset sequences
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Infinite synchronizing words for probabilistic automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Lower bounds for the length of reset words in Eulerian automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Approximating the minimum length of synchronizing words is hard
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Synchronizing automata on quasi-eulerian digraph
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Synchronizing automata of bounded rank
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Synchronization of automata with one undefined or ambiguous transition
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On the length of homing sequences for nondeterministic finite state machines
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 0.00 |
We survey several results and open problems related to synchronizing automata. In particular, we discuss some recent advances towards a solution of the Černý conjecture.