Abstract
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely reachable automata in terms of certain directed graphs.
Author supplied keywords
Cite
CITATION STYLE
APA
Bondar, E. A., & Volkov, M. V. (2018). A Characterization of Completely Reachable Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11088 LNCS, pp. 145–155). Springer Verlag. https://doi.org/10.1007/978-3-319-98654-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free