Slowly synchronizing automata with zero and noncomplete sets

DOI10.1134/S0001434611090094zbMath1291.68231OpenAlexW1919656470MaRDI QIDQ2435786

Elena V. Pribavkina

Publication date: 20 February 2014

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434611090094

zbMATH Keywords

free monoidsynchronizing wordnondeterministic automatonmaximal codedeterministic automatonnoncomplete setsynchronizing automaton (with zero)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the length of uncompletable words in unambiguous automata ⋮ Attainable Values of Reset Thresholds

Cites Work

• Synchronizing automata preserving a chain of partial orders
• Synchronizing automata with a letter of deficiency 2
• A series of slowly synchronizing automata with a zero state over a small alphabet
• Reset words for commutative and solvable automata
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• Synchronizing Automata and the Černý Conjecture
• Slowly Synchronizing Automata and Digraphs
• Algebraic Theory of Automata and Languages
• Unnamed Item

This page was built for publication: Slowly synchronizing automata with zero and noncomplete sets