On synchronizing unambiguous automata

DOI10.1016/0304-3975(88)90114-4MaRDI QIDQ1116340zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Synchronization of automata with one undefined or ambiguous transition
• On synchronizing automata and uniform distribution
• Synchronizing Automata and the Černý Conjecture
• Synchronizing Automata with Extremal Properties
• scientific article; zbMATH DE number 826076
• The Synchronization Problem for Strongly Transitive Automata
• scientific article; zbMATH DE number 1953272
• Synchronization of finite automata
• Synchronizing non-deterministic finite automata
• Synchronization and stability of finite automata

Cites work

• scientific article; zbMATH DE number 3864504 (Why is no real title available?)
• scientific article; zbMATH DE number 3529706 (Why is no real title available?)
• scientific article; zbMATH DE number 3605922 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3803447 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3266647 (Why is no real title available?)
• Sur certains sous-monoïdes libres
• Synchronizing Sequences for Probabilistic Automata
• Unsolvability in 3 × 3 Matrices

Cited in

(13)

• Strongly transitive automata and the Černý conjecture
• On Nonnegative Integer Matrices and Short Killing Words
• Mortality and synchronization of unambiguous finite automata
• Semisimple synchronizing automata and the Wedderburn-Artin theory
• On the length of uncompletable words in unambiguous automata
• Ranks of binary relations
• On finite monoids over nonnegative integer matrices and short killing words
• scientific article; zbMATH DE number 7376069 (Why is no real title available?)
• scientific article; zbMATH DE number 7438568 (Why is no real title available?)
• The Synchronization Problem for Locally Strongly Transitive Automata
• The Synchronization Problem for Strongly Transitive Automata
• On incomplete and synchronizing finite sets
• On codes with a finite deciphering delay: Constructing uncompletable words

This page was built for publication: On synchronizing unambiguous automata

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