Complexity of problems concerning reset words for some partial cases of automata

Recommendations

Complexity of problems concerning reset words for cyclic and Eulerian automata
Complexity of problems concerning reset words for cyclic and Eulerian automata
The complexity of finding reset words in finite automata
Complexity of a problem concerning reset words for Eulerian binary automata
Complexity of a problem concerning reset words for Eulerian binary automata

Cited in

(21)

Reset words for commutative and solvable automata
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
Sync-maximal permutation groups equal primitive permutation groups
Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
Preimage problems for deterministic finite automata
Computing the shortest reset words of synchronizing automata
Checking whether an automaton is monotonic is NP-complete
Lower Bounds for the Length of Reset Words in Eulerian Automata
The complexity of finding reset words in finite automata
Complexity of problems concerning reset words for cyclic and Eulerian automata
On the Computational Complexity of Partial Word Automata Problems
Complexity of preimage problems for deterministic finite automata
Synchronizing series-parallel deterministic finite automata with loops and related problems
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Semicomputable points in Euclidean spaces
Complexity of a problem concerning reset words for Eulerian binary automata
Complexity of problems concerning reset words for cyclic and Eulerian automata
scientific article; zbMATH DE number 7156375 (Why is no real title available?)
Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
Complexity of a problem concerning reset words for Eulerian binary automata
Parameterized complexity of factorization problems

This page was built for publication: Complexity of problems concerning reset words for some partial cases of automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5306174)