Unambiguous automata

DOI10.1007/S11786-007-0027-1MaRDI QIDQ942992zbMATH OpenOpenAlexWikidataFDO

Authors Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin

Publication date 8 September 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0027-1

zbMATH Keywords

automataunambiguous automatalocal automatasynchronized automataunambiguous monoids of relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4094825
• Unambiguity in automata theory
• Publication:4508396
• Unambiguous constrained automata
• Unambiguous constrained automata
• Structurally Unambiguous Finite Automata
• Unambiguous finite automata over a unary alphabet
• Unambiguous finite automata over a unary alphabet
• Unambiguous automata denoting finitely sequential functions

Cited in

(12)

• Strongly transitive automata and the Černý conjecture
• Mortality and synchronization of unambiguous finite automata
• Operations on Unambiguous Finite Automata
• On the length of uncompletable words in unambiguous automata
• Modifying the upper bound on the length of minimal synchronizing word
• New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
• Unambiguous Büchi automata.
• Operations on Unambiguous Finite Automata
• The Synchronization Problem for Strongly Transitive Automata
• Unary Self-verifying Symmetric Difference Automata
• Codes and noncommutative stochastic matrices
• scientific article; zbMATH DE number 6741931 (Why is no real title available?)

This page was built for publication: Unambiguous automata

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