Separating words with automata is a longstanding open problem in combinatorics on words. In this paper we present a related algebraic problem. What is the minimal length of a nontrivial identical relation in the symmetric group Sn? Our main contribution is an upper bound 2 O(√n log n) on the length of the shortest nontrivial identical relation in Sn. We also give lower bounds for words of a special types. These bounds can be applied to the problem of separating words by reversible automata. In this way we obtain an another proof of the Robson's square root bound. © 2010 Springer-Verlag.
CITATION STYLE
Gimadeev, R. A., & Vyalyi, M. N. (2010). Identical relations in symmetric groups and separating words with reversible automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6072 LNCS, pp. 144–155). https://doi.org/10.1007/978-3-642-13182-0_14
Mendeley helps you to discover research relevant for your work.