• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Unambiguous Automata

Marie-Pierre Beal, Eugen Czeizler, Jarkko Kari, Dominique Perrin, Unambiguous Automata. Mathematics in Computer Science 1(4), 625–638, 2008.

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.

BibTeX entry:

@ARTICLE{jBeCzKaPe08a,
  title = {Unambiguous Automata},
  author = {Beal, Marie-Pierre and Czeizler, Eugen and Kari, Jarkko and Perrin, Dominique},
  journal = {Mathematics in Computer Science},
  volume = {1},
  number = {4},
  pages = {625–638},
  year = {2008},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication