Complexity of problems concerning reset words for cyclic and Eulerian automata

Authors:
Pavel Martyugin
Affiliations:
Ural State University, Ekaterinburg, Russia
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 8
Cited 0

Reset sequences for monotonic automata

SIAM Journal on Computing
Composition sequences for functions over a finite domain

Theoretical Computer Science
Synchronizing finite automata on Eulerian digraphs

Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing monotonic automata

Theoretical Computer Science - Developments in language theory
Synchronizing automata preserving a chain of partial orders

Theoretical Computer Science
Complexity of problems concerning reset words for some partial cases of automata

Acta Cybernetica
The complexity of finding reset words in finite automata

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximating the minimum length of synchronizing words is hard

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A word is called a reset word for a deterministic finite automaton if it maps all states of this automaton to one state. We consider two classes of automata: cyclic automata and Eulerian automata. For these classes we study the computational complexity of the following problems: does there exist a reset word of given length for a given automaton? what is the minimal length of the reset words for a given automaton?