Completely Reachable Automata
From MaRDI portal
Publication:2829965
DOI10.1007/978-3-319-41114-9_1zbMath1435.68145arXiv1607.00554MaRDI QIDQ2829965
E. A. Bondar', Mikhail V. Volkov
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00554
PSPACE-completeness; deterministic finite automaton; syntactic complexity; transition monoid; complete reachability
68Q45: Formal languages and automata