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

DOI10.1016/0304-3975(88)90029-1zbMath0648.20065OpenAlexW2001930099MaRDI 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 semigroupinfinite wordsfinite alphabetsyntaxpiecewise testable languagesEilenberg's theory of varietiesrational \(\omega \)- languages

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• A syntactic congruence for rational \(\omega\)-languages
• Locally testable languages
• Characterizations of locally testable events
• On ω-regular sets
• A combinatorial approach to the theory of ω-automata
• Algebraic decision procedures for local testability
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• 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: Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)