Recent results on syntactic groups of prefix codes.

DOI10.1016/j.ejc.2012.03.004zbMath1272.20062MaRDI QIDQ444391

Clelia De Felice, Christophe Reutenauer, Jean Berstel, Giuseppina Rindone, Dominique Perrin

Publication date: 14 August 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00790638/file/syntacticGroups.pdf

zbMATH Keywords

maximal subgroups; free semigroups; finite automata; prefix codes; finite transformation monoids; syntactic groups

Mathematics Subject Classification ID

68R15: Combinatorics on words

20M20: Semigroups of transformations, relations, partitions, etc.

20M05: Free semigroups, generators and relations, word problems

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

20M30: Representation of semigroups; actions of semigroups on sets

Related Items

Groups and decompositions of codes, On the decomposition of prefix codes, Flow equivalence of sofic shifts, Bifix codes and Sturmian words

Cites Work

• On the groups of codes with empty kernel.
• On syntactic groups.
• Bifix codes and Sturmian words
• Return words in Sturmian and episturmian words
• Complexity of some problems from the theory of automata
• Algorithms for computing finite semigroups
• Episturmian words and some constructions of de Luca and Rauzy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item