A Characterization of Completely Reachable Automata
Eugenija Bondar, Mikhail Volkov
TL;DR
This paper characterizes completely reachable automata, where every non-empty subset of states can be reached from the entire state set, using directed graph properties.
Contribution
It provides a novel characterization of completely reachable automata through the analysis of specific directed graphs.
Findings
Complete characterization of completely reachable automata.
Connection between automata reachability and graph properties.
Framework for identifying completely reachable automata.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.