Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

DOI10.1007/978-3-319-04921-2_47zbMath1362.68158arXiv1409.2003OpenAlexW2142966575MaRDI QIDQ5404945

Vojtěch Vorel

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.2003

Mathematics Subject Classification ID

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

This page was built for publication: Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata