2000 character limit reached
Slowly synchronizing automata with zero and incomplete sets
Published 27 Jul 2009 in cs.FL | (0907.4576v1)
Abstract: Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n2/4+n/2-1.
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.