Resetting words for decidable automata

DOI10.1007/BF02366438MaRDI QIDQ1905219zbMATH OpenOpenAlexFDO

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

Recommendations

• Experimental study of the shortest reset word of random automata
• Reset words for commutative and solvable automata
• The Černý conjecture for automata respecting intervals of a directed graph
• The Černý conjecture for one-cluster automata with prime length cycle
• Complexity of problems concerning reset words for cyclic and Eulerian automata

Cites work

• scientific article; zbMATH DE number 3168668 (Why is no real title available?)
• scientific article; zbMATH DE number 3902880 (Why is no real title available?)
• scientific article; zbMATH DE number 3346278 (Why is no real title available?)
• scientific article; zbMATH DE number 3365977 (Why is no real title available?)
• The Theory of Definite Automata
• Triality and Lie algebras of type \(D_4\)

Cited in

(5)

• On the height of a finite automaton
• Finitely Generated Synchronizing Automata
• Synchronizing automata with finitely many minimal synchronizing words
• Groups and semigroups defined by colorings of synchronizing automata.
• scientific article; zbMATH DE number 7310085 (Why is no real title available?)

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

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