Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)

DOI10.1016/0304-3975(87)90127-7zbMath0668.20070OpenAlexW1966636504MaRDI QIDQ1118045

Giuseppina Rindone

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90127-7

zbMATH Keywords

codefree monoidsalphabetsubgroups of free groupsgenerating codePerrin conjecturesyntactic group

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Bifix codes and Sturmian words

Cites Work

• Periodes et repetitions des mots du monoide libre
• Parallel concepts in graph theory
• Hamiltonian cycles in cayley color graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)