Identical relations in symmetric groups and separating words with reversible automata

DOI10.1007/978-3-642-13182-0_14zbMATH Open1285.68134OpenAlexW1652789087MaRDI QIDQ3569739FDOQ3569739

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

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

zbMATH Keywords

automatonsymmetric groupidentity

Mathematics Subject Classification ID

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

Cited In (8)

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

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)