Two characterizations of rational adherences

DOI10.1016/0304-3975(86)90025-3MaRDI QIDQ1822510zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• A homomorphic characterization of regular languages
• A note on morphic characterization of languages
• Adherences of languages
• scientific article; zbMATH DE number 3829283 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3602692 (Why is no real title available?)
• Relations rationnelles infinitaires
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• Testing and generating infinite sequences by a finite automaton

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822510)