Primitive digraphs with large exponents and slowly synchronizing automata

We present several infinite series of synchronozing 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 exponents. Bibliography: 28 titles.

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2013-07, Vol.192 (3), p.263-278
Main Authors: Ananichev, D. S., Volkov, M. V., Gusev, V. V.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Robots
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present several infinite series of synchronozing 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 exponents. Bibliography: 28 titles.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-013-1392-8