scientific article

zbMath0301.94069MaRDI QIDQ4055589

Ludwig Staiger, Klaus W. Wagner

Publication date: 1974

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (34)

On omega context free languages which are Borel sets of infinite rank. ⋮ Infinite-word languages and continuous mappings ⋮ The greatest fixed-points and rational omega-tree languages ⋮ Level two of the quantifier alternation hierarchy over infinite words ⋮ Accepting conditions for automata on \(\omega\)-languages ⋮ The Wadge-Wagner hierarchy of ω-rational sets ⋮ Language-theoretical representations of \(\omega\)-languages ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages ⋮ Fine hierarchy of regular ω-languages ⋮ On syntactic congruences for \(\omega\)-languages ⋮ On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words ⋮ Ambiguity in omega context free languages ⋮ Unnamed Item ⋮ Complexity of Topological Properties of Regular ω-Languages ⋮ Fractals, dimension, and formal languages ⋮ Literal shuffle on \(\omega\)-languages ⋮ Characterizations of rational \(\omega\)-languages by means of right congruences ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ \(X\)-automata on \(\omega\)-words ⋮ Level Two of the Quantifier Alternation Hierarchy over Infinite Words ⋮ Topological properties of omega context-free languages ⋮ Topology on words ⋮ Finite acceptance of infinite words ⋮ Don't care words with an application to the automata-based approach for real addition ⋮ Characterization of \(\omega\)-regular languages by monadic second-order formulas ⋮ \( \omega \)-automata ⋮ A note on \(\omega\)-regular languages ⋮ Finite-state \(\omega\)-languages ⋮ Alternating finite automata on \(\omega\)-words ⋮ Complexity of weak acceptance conditions in tree automata. ⋮ Characterization of \(\omega\)-regular languages by first-order formulas ⋮ Efficient minimization of deterministic weak \(\omega\)-automata ⋮ Shift-invariant topologies for the Cantor space \(X^{\omega}\)

This page was built for publication: