Non-repetitive words relative to a rewriting system

DOI10.1016/0304-3975(90)90045-JzbMath0693.68040OpenAlexW2043361382MaRDI QIDQ908710

Arturo Carpi, Aldo De Luca

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90045-j

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

On the algorithmic decidability of the square-free word problem relative to a system of two defining relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost all one-rule Thue systems have decidable word problems
• Square-free words on partially commutative free monoids
• Combinatorial problems of commutation and rearrangements
• Unending chess, symbolic dynamics and a problem in semi-groups
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
• A Sequence Without Repeats on x, x -1 , y, y -1

This page was built for publication: Non-repetitive words relative to a rewriting system