Rebootable and suffix-closed $\omega $-power languages
From MaRDI portal
Publication:3991292
DOI10.1051/ita/1992260100451zbMath0768.68079MaRDI QIDQ3991292
Igor Litovsky, Bertrand Le Saëc
Publication date: 28 June 1992
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92408
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-state \(\omega\)-languages
- A syntactic congruence for rational \(\omega\)-languages
- Finitely generated \(\omega\)-languages
- On generators of rational \(\omega\)-power languages
- Adherences of languages
- On?-Languages whose syntactic monoid is trivial
- On infinitary finite length codes
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton