Resetting words for decidable automata

DOI10.1007/BF02366438zbMath0837.68076OpenAlexW2105536033MaRDI QIDQ1905219

I. K. Rystsov

Publication date: 16 April 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366438

zbMATH Keywords

finite automatondecidable automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

Groups and semigroups defined by colorings of synchronizing automata ⋮ Synchronizing automata with finitely many minimal synchronizing words ⋮ Finitely Generated Synchronizing Automata ⋮ Unnamed Item

Cites Work

• Triality and Lie algebras of type \(D_4\)
• The Theory of Definite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resetting words for decidable automata