Synchronizing groups and automata

  title={Synchronizing groups and automata},
  author={Fredrick Arnold and Benjamin Steinberg},
  journal={Theor. Comput. Sci.},
Pin showed that every p-state automaton (p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most (p− 1). In this paper we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation groups whose permutation character over the rationals splits into a sum of only two irreducible characters… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

A linear algebra approach to synchronizing automata

F. Arnold
Master’s Thesis, Carleton University, • 2005

Finite permutation groups of rank 3

D. G. Higman, J. E. McLAUGHLn
View 1 Excerpt

and B

J. D. Dixo
Mortimer, “Permutation groups.” Springer-Verlag, New York • 1996
View 2 Excerpts

Studies in the representation theory of finite semigroups

Y. Zalcstein
Trans. Amer. Math. Soc • 1971
View 2 Excerpts

Poznámka k homogénnym eksperimentom s konecnými avtomatami, Mat.Fyz

J. Černý
Cas. Solvensk. Akad. Vied • 1964
View 2 Excerpts

Similar Papers

Loading similar papers…