On the length of uncompletable words in unambiguous automata

DOI10.1051/ita/2019002zbMath1434.68234OpenAlexW2941322157MaRDI QIDQ5108371

Antonio Boccuto, Arturo Carpi

Publication date: 4 May 2020

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

Full work available at URL: https://doi.org/10.1051/ita/2019002

zbMATH Keywords

uncompletable wordcomplete automatonunambiguous automatonrelatively maximal row

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On incomplete and synchronizing finite sets
• Unambiguous automata
• Strongly transitive automata and the Černý conjecture
• On synchronizing unambiguous automata
• Minimal complete sets of words
• Independent sets of words and the synchronization problem
• Slowly synchronizing automata with zero and noncomplete sets
• Completing circular codes in regular submonoids
• Principal Ideal Languages and Synchronizing Automata
• On two Combinatorial Problems Arising from Automata Theory
• Completing codes
• Application de l'optimisation en nombres entiers à un problème d'«arrondissage»
• On Non-complete Sets and Restivo’s Conjecture
• Unsolvability in 3 × 3 Matrices
• On codes with a finite deciphering delay: Constructing uncompletable words

This page was built for publication: On the length of uncompletable words in unambiguous automata