arXiv Open Access 2009

Slowly synchronizing automata with zero and incomplete sets

E. V. Pribavkina

Lihat Sumber

Abstrak

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 n^2/4+n/2-1.

Topik & Kata Kunci

cs.FL

Penulis (1)

E. V. Pribavkina

Format Sitasi

APA MLA BibTeX

Pribavkina, E.V. (2009). Slowly synchronizing automata with zero and incomplete sets. https://arxiv.org/abs/0907.4576

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓