Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
From MaRDI portal
Publication:1105050
DOI10.1016/0304-3975(88)90029-1zbMath0648.20065MaRDI QIDQ1105050
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
free semigroup; infinite words; finite alphabet; syntax; piecewise testable languages; Eilenberg's theory of varieties; rational \(\omega \)- languages
20M35: Semigroups in automata theory, linguistics, etc.