ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x2= x3

DOI10.1142/S0218196711006558zbMath1242.20064arXiv1102.4315OpenAlexW2963675440MaRDI QIDQ3097925

A. N. Plyushchenko, Arseny M. Shur

Publication date: 10 November 2011

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.4315

zbMATH Keywords

word problemoverlap-free wordsfree Burnside semigroups

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18)

Related Items (2)

On a variety of Burnside ai-semirings satisfying \(x^n\approx x\) ⋮ Obituary: Aldo de Luca 1941--2018

Cites Work

• On noncounting regular classes
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• Free Burnside Semigroups
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3
• ON THE BURNSIDE SEMIGROUPS xⁿ = x^n+m
• OVERLAP-FREE WORDS AND THUE-MORSE SEQUENCES

This page was built for publication: ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x²= x³