Primitive digraphs with large exponents and slowly synchronizing automata
classification
💻 cs.FL
keywords
automatadigraphslargeprimitivesynchronizingcloseexponentexponents
read the original abstract
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. All these automata are tightly related to primitive digraphs with large exponent.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.