Two characterizations of rational adherences

DOI10.1016/0304-3975(86)90025-3zbMath0618.68066OpenAlexW2091219236MaRDI QIDQ1822510

E. Timmerman, Michel Latteux

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90025-3

zbMATH Keywords

morphismsrational \(\omega \)-languagesrational adherences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction ⋮ Literal shuffle on \(\omega\)-languages ⋮ \(X\)-automata on \(\omega\)-words ⋮ Minimal generators of submonoids of $A^\infty $ ⋮ Topology on words

Cites Work

• Relations rationnelles infinitaires
• Adherences of languages
• A homomorphic characterization of regular languages
• A note on morphic characterization of languages
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two characterizations of rational adherences