Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)

DOI10.1016/0304-3975(88)90029-1zbMath0648.20065MaRDI QIDQ1105050

Jean-Pierre Pecuchet

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90029-1

zbMATH Keywords

free semigroup; infinite words; finite alphabet; syntax; piecewise testable languages; Eilenberg's theory of varieties; rational \(\omega \)- languages

Mathematics Subject Classification ID

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