Slowly synchronizing automata with zero and noncomplete sets

DOI10.1134/S0001434611090094MaRDI QIDQ2435786zbMATH OpenOpenAlexFDO

Authors Elena 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

deterministic automatonfree monoidmaximal codenoncomplete setnondeterministic automatonsynchronizing automaton (with zero)synchronizing word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A series of slowly synchronizing automata with a zero state over a small alphabet
• Slowly synchronizing automata and digraphs
• Synchronizing Automata with a Letter of Deficiency 2
• Synchronizing automata with a letter of deficiency 2
• Synchronizing times for k-sets in automata

Cites work

• A series of slowly synchronizing automata with a zero state over a small alphabet
• Algebraic Theory of Automata and Languages
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• scientific article; zbMATH DE number 1346363 (Why is no real title available?)
• Reset words for commutative and solvable automata
• Slowly synchronizing automata and digraphs
• Synchronizing Automata and the Černý Conjecture
• Synchronizing automata preserving a chain of partial orders
• Synchronizing automata with a letter of deficiency 2

Cited in

(5)

• Slowly synchronizing automata with fixed alphabet size
• On the length of uncompletable words in unambiguous automata
• Attainable values of reset thresholds
• scientific article; zbMATH DE number 7152087 (Why is no real title available?)
• A series of slowly synchronizing automata with a zero state over a small alphabet

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435786)