scientific article; zbMATH DE number 1206597

MaRDI QIDQ4209249zbMATH OpenFDO

Authors Wolf Göhring

Publication date 6 October 1998

zbMATH Keywords

finite automatonsynchronizable automatonČerný's conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The Černý conjecture for automata respecting intervals of a directed graph
• Generating small automata and the Černý conjecture
• Strongly connected synchronizing automata and the language of minimal reset words
• The Černý conjecture for one-cluster automata with prime length cycle

Cited in

(9)

• Minimal Discriminating Words Problem Revisited
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• The Černý conjecture for automata with blocking states
• Generating small automata and the Černý conjecture
• Synchronizing finite automata on Eulerian digraphs.
• The averaging trick and the Černý conjecture
• The averaging trick and the Černý conjecture
• Synchronizing series-parallel deterministic finite automata with loops and related problems
• A note on homogeneous experiments with finite automata

This page was built for publication:

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