A note on \(\omega\)-regular languages
From MaRDI portal
Publication:1053464
DOI10.1016/0304-3975(83)90057-9zbMath0517.68072OpenAlexW2042023164MaRDI QIDQ1053464
Masako Takahashi, Hideki Yamasaki
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90057-9
Related Items (16)
Infinite-word languages and continuous mappings ⋮ The greatest fixed-points and rational omega-tree languages ⋮ Topological characterizations of infinite tree languages ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Accepting conditions for automata on \(\omega\)-languages ⋮ Language-theoretical representations of \(\omega\)-languages ⋮ 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 ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Prefix-free languages as \(\omega\)-generators ⋮ Finite acceptance of infinite words ⋮ Various hierarchies of \(\omega\)-regular sets ⋮ Characterization of \(\omega\)-regular languages by monadic second-order formulas ⋮ A classification of \(\omega\)-regular languages ⋮ Characterization of \(\omega\)-regular languages by first-order formulas
Cites Work
This page was built for publication: A note on \(\omega\)-regular languages
