scientific article; zbMATH DE number 4039337
From MaRDI portal
Publication:3777489
zbMATH Open0637.68095MaRDI QIDQ3777489FDOQ3777489
Authors: Ludwig Staiger 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
surveyfinite automatapushdown automatabibliographyTuring machinesBorel hierarchy\(\omega \)-languages
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cited In (27)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language-theoretical representations of \(\omega\)-languages
- Finite acceptance of infinite words
- Iterated function systems and control languages
- Highly Undecidable Problems For Infinite Computations
- Fine hierarchy of regular \(\omega\)-languages
- Sequential mappings of $\omega $-languages
- Fine hierarchy of regular \(\omega\)-languages
- \(X\)-automata on \(\omega\)-words
- The disjunctivities of \(\omega\)-languages.
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Local Hausdorff dimension
- ω-Automata
- Prefix-free languages as \(\omega\)-generators
- Title not available (Why is that?)
- Finite-state \(\omega\)-languages
- Fractals, dimension, and formal languages
- Various hierarchies of \(\omega\)-regular sets
- On syntactic congruences for \(\omega\)-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal generators of submonoids of $A^\infty $
- Projection lemmas for \(\omega\)-languages
- Rebootable and suffix-closed $\omega $-power languages
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
- Valuations of languages, with applications to fractal geometry
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777489)
