Extremal Binary PFAs with Small Number of States

DOI10.1142/s0129054122440038arXiv2108.13927OpenAlexW4287020706MaRDI QIDQ6169960

Henk Don, Stijn Cambie, Michiel de Bondt

Publication date: 15 August 2023

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

Full work available at URL: https://arxiv.org/abs/2108.13927

zbMATH Keywords

synchronizationfinite automataČerný conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal binary PFAs in a Černý family
• An extremal problem for two families of sets
• Subset Synchronization and Careful Synchronization of Binary Finite Automata
• Synchronizing Automata and the Černý Conjecture
• On two Combinatorial Problems Arising from Automata Theory
• An improvement to a recent upper bound for synchronizing words of finite automata
• Lower Bounds for Synchronizing Word Lengths in Partial Automata

This page was built for publication: Extremal Binary PFAs with Small Number of States