On synchronizing unambiguous automata

DOI10.1016/0304-3975(88)90114-4zbMath0665.68044OpenAlexW2059007468MaRDI QIDQ1116340

Arturo Carpi

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90114-4

zbMATH Keywords

complete automatonnondeterministic automatonunambiguous automatonsynchronizing sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (9)

The Synchronization Problem for Locally Strongly Transitive Automata ⋮ Ranks of binary relations ⋮ On the length of uncompletable words in unambiguous automata ⋮ The Synchronization Problem for Strongly Transitive Automata ⋮ On incomplete and synchronizing finite sets ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ On finite monoids over nonnegative integer matrices and short killing words ⋮ Strongly transitive automata and the Černý conjecture ⋮ On Nonnegative Integer Matrices and Short Killing Words

Cites Work

• Sur certains sous-monoïdes libres
• Unsolvability in 3 × 3 Matrices
• Synchronizing Sequences for Probabilistic Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On synchronizing unambiguous automata