Reset complexity of ideal languages over a binary alphabet

DOI10.1007/978-3-319-60252-3_21zbMath1489.68130OpenAlexW3023543025MaRDI QIDQ2401010

Marina Maslennikova

Publication date: 31 August 2017

Full work available at URL: http://hdl.handle.net/10995/102109

zbMATH Keywords

PSPACE-completenessreset wordsynchronizing automatonideal languagereset complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words ⋮ State complexity of the set of synchronizing words for circular automata and automata over binary alphabets ⋮ Reset Complexity of Ideal Languages Over a Binary Alphabet ⋮ Sync-maximal permutation groups equal primitive permutation groups

This page was built for publication: Reset complexity of ideal languages over a binary alphabet