Synchronizing almost-group automata

DOI10.1142/S0129054120420058zbMATH Open1458.68089OpenAlexW3110860036MaRDI QIDQ5859664FDOQ5859664

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

Recommendations

• Synchronizing random almost-group automata
• Groups synchronizing a transformation of non-uniform kernel
• On the probability of being synchronizable
• Synchronizing random automata on a 4-letter alphabet
• Synchronizing groups and automata

zbMATH Keywords

synchronizationrandom automataalmost-group automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Synchronizing Automata and the Černý Conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reset Sequences for Monotonic Automata
• On two Combinatorial Problems Arising from Automata Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• The road coloring problem
• On the Probability of Being Synchronizable
• Algorithms and Data Structures
• Random Deterministic Automata
• Title not available (Why is that?)
• Synchronizing random almost-group automata
• Title not available (Why is that?)
• A quadratic algorithm for road coloring

Cited In (2)

• Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
• Fast synchronization of inhomogenous random automata

This page was built for publication: Synchronizing almost-group automata

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