Synchronizing Almost-Group Automata

DOI10.1142/S0129054120420058zbMath1458.68089OpenAlexW3110860036MaRDI QIDQ5859664

Mikhail V. Berlinkov, Cyril Nicaud

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120420058

zbMATH Keywords

synchronizationrandom automataalmost-group automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Fast synchronization of inhomogenous random automata

Cites Work

• The road coloring problem
• Synchronizing random almost-group automata
• A quadratic algorithm for road coloring
• On the Probability of Being Synchronizable
• Random Deterministic Automata
• Reset Sequences for Monotonic Automata
• Synchronizing Automata and the Černý Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing Almost-Group Automata