Identical relations in symmetric groups and separating words with reversible automata

DOI10.1007/978-3-642-13182-0_14MaRDI QIDQ3569739zbMATH OpenOpenAlexFDO

Authors R. A. Gimadeev, Mikhail Vyalyi

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13182-0_14

zbMATH Keywords

automatonidentitysymmetric group

Mathematics Subject Classification ID

Symmetric groups (20B30) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Words separation and positive identities in symmetric groups
• On the membership problem for finite automata over symmetric groups
• Lower bounds on words separation: are there short identities in transformation semigroups?
• Separating words with machines and groups
• On the gap between separating words and separating their reversals

Cited in

(8)

• On the gap between separating words and separating their reversals
• About the length of laws for finite groups
• Divisibility and laws in finite simple groups.
• The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces.With the appendix by Khalid Bou–Rabee
• Separating words with machines and groups
• Words separation and positive identities in symmetric groups
• Remarks on separating words
• Primitivity index bounds in free groups, and the second Chebyshev function

This page was built for publication: Identical relations in symmetric groups and separating words with reversible automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569739)