2000 character limit reached
A Characterization of Completely Reachable Automata
Published 8 May 2018 in cs.FL | (1805.02879v1)
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.
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.