Slowly synchronizing automata and digraphs
classification
💻 cs.FL
cs.DM
keywords
automatadigraphssynchronizingclosecloselyexponentinfinitelarge
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. These automata are closely 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.