scientific article; zbMATH DE number 3641729
From MaRDI portal
Publication:4200990
zbMath0413.20042MaRDI QIDQ4200990
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (18)
Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) ⋮ Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) ⋮ Recognizability of morphisms ⋮ Unnamed Item ⋮ Bifix codes and Sturmian words ⋮ Periods in strings ⋮ Recent results on syntactic groups of prefix codes. ⋮ On some combinatorial problems in free monoids ⋮ The Ehrenfeucht-Silberger problem ⋮ A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) ⋮ Unnamed Item ⋮ Parsing with a finite dictionary ⋮ On unique factorizations of primitive words. ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini ⋮ Periodes et repetitions des mots du monoide libre ⋮ Synchronization and simplification ⋮ Codes and Bernoulli partitions
This page was built for publication:
