Emergent Mind
Completely reachable automata: an interplay between automata, graphs, and trees
(2201.05075)
Published Jan 13, 2022
in
cs.FL
Abstract
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.