Les automates circulaires biaisés vérifient la conjecture de Černý

DOI10.1051/ita/1996300604951zbMath0877.68083OpenAlexW2394523665WikidataQ123145236 ScholiaQ123145236MaRDI QIDQ4341035

L. Dubuc

Publication date: 27 July 1997

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92548

zbMATH Keywords

Černý conjecturebiased circular actions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ State complexity of the set of synchronizing words for circular automata and automata over binary alphabets ⋮ Sync-maximal permutation groups equal primitive permutation groups

Cites Work

• An extremal problem for two families of sets
• On two Combinatorial Problems Arising from Automata Theory
• RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Les automates circulaires biaisés vérifient la conjecture de Černý