Abstract.
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton. The proofs are based on results on unambiguous monoids of relations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by the Academy of Finland grant 211967 and by the Turku University Foundation grant.
Rights and permissions
About this article
Cite this article
Béal, MP., Czeizler, E., Kari, J. et al. Unambiguous Automata. Math.comput.sci. 1, 625–638 (2008). https://doi.org/10.1007/s11786-007-0027-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-007-0027-1