Slowly synchronizing automata with zero and noncomplete sets
From MaRDI portal
Publication:2435786
DOI10.1134/S0001434611090094zbMath1291.68231MaRDI QIDQ2435786
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
free monoid; synchronizing word; nondeterministic automaton; maximal code; deterministic automaton; noncomplete set; synchronizing automaton (with zero)
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- 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