Primitive digraphs with large exponents and slowly synchronizing automata

Ananichev, D. S.
Volkov, M. V.
Gusev, V. V.

Open PDF

Open link

Publication date

January 2013

DOI

10.1007/s10958-013-1392-8

Publisher

Springer Science and Business Media LLC

ISSN

1072-3374

Journal

Journal of Mathematical Sciences

Citation count (estimate)

Abstract

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. © 2013 Springer Science+Business Media New York

Extracted data

We use cookies to provide a better user experience.

Data Protection

Primitive digraphs with large exponents and slowly synchronizing automata

Abstract

Extracted data

Primitive digraphs with large exponents and slowly synchronizing automata

Abstract

Extracted data

Related items

Related items