2000 character limit reached
Completely reachable automata: an interplay between automata, graphs, and trees
Published 13 Jan 2022 in cs.FL | (2201.05075v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.