Unambiguous Automata

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. Mathematics Subject Classification (2000). 68Q45;20M35;94A45;68R15. Keywords. automata, local automata, synchronized automata, unambiguous automata, unambiguous monoids of relations.

• Type: Journal
• Year: 2008
• Where: MICS
• Authors: Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
• Keywords: Complete Local Automata, Local Automata, MICS 2008, Unambiguous Monoids