Characterization and closure properties of linear -languages
From MaRDI portal
Publication:1127314
Recommendations
Cites work
- Adherences of languages
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3602692 (Why is no real title available?)
- Testing and generating infinite sequences by a finite automaton
- Theory of -languages. I: Characterizations of -context- free languages
Cited in
(13)- A negative answer to a question of Wilke on varieties of \(\omega\)-languages
- Logic for \(\omega\)-pushdown automata
- Closure properties of linear context-free tree languages with an application to optimality theory
- scientific article; zbMATH DE number 4039337 (Why is no real title available?)
- scientific article; zbMATH DE number 4088952 (Why is no real title available?)
- Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
- scientific article; zbMATH DE number 4114062 (Why is no real title available?)
- Two theorems on the Hausdorff measure of regular -languages
- Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
- An algorithmic approach for checking closure properties of Ω-regular languages
- Finite-state \(\omega\)-languages
- Safety and liveness of \(\omega\)-context-free languages
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
This page was built for publication: Characterization and closure properties of linear \(\omega\)-languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127314)
