Syntactic semigroups of avoided languages

DOI10.1007/BF02673917zbMath0905.20037MaRDI QIDQ1272006

Arseny M. Shur

Publication date: 22 November 1998

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

word problemsyntactic congruencesstrongly cube-free wordssyntactic semigroupswords avoided by languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Deciding context equivalence of binary overlap-free words in linear time

Cites Work

• Unnamed Item
• Avoidable patterns in strings of symbols
• Binary words avoided by the Thue-Morse sequence
• OVERLAP-FREE WORDS AND THUE-MORSE SEQUENCES
• A Characterization of the Morse Minimal Set

This page was built for publication: Syntactic semigroups of avoided languages