scientific article; zbMATH DE number 3989655
From MaRDI portal
Publication:3752578
zbMATH Open0612.20039MaRDI QIDQ3752578FDOQ3752578
Authors: Jean-Pierre Pecuchet 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- scientific article; zbMATH DE number 3959795
- scientific article; zbMATH DE number 988807
- Languages obtained from infinite words
- Finite semigroups with infinite product and languages of infinite words.
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Mappings of semigroups (20M15)
Cited In (8)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words)
- Logic over words on denumerable ordinals
- An algorithmic approach for checking closure properties of Ω-regular languages
- Star-free sets of words on ordinals
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
- Rabin tree automata and finite monoids
- A negative answer to a question of Wilke on varieties of \(\omega\)-languages
- Wreath product and infinite words
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752578)
