2000 character limit reached
Completely Reachable Automata
Published 2 Jul 2016 in cs.FL | (1607.00554v1)
Abstract: We present a few results and several open problems concerning complete deterministic finite automata 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.
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.
