Infinite-word languages and continuous mappings
From MaRDI portal
Publication:1082087
DOI10.1016/0304-3975(86)90166-0zbMATH Open0602.68059OpenAlexW2087465671MaRDI QIDQ1082087FDOQ1082087
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)90166-0
Formal languages and automata (68Q45) Connections of general topology with other structures, applications (54H99)
Cites Work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Data Types as Lattices
- Finite-state \(\omega\)-languages
- Theories of automata on \(\omega\)-tapes: a simplified approach
- A combinatorial approach to the theory of ω-automata
- Decision problems forω-automata
- Star-free regular sets of ω-sequences
- Solving Sequential Conditions by Finite-State Strategies
- On ω-regular sets
- Definability in the monadic second-order theory of successor
- A note on \(\omega\)-regular languages
- Adherences of languages
- Some remarks on non-algebraic adherences
- Fixed-point characterization of context-free ∞-languages
- Sets of Numbers Defined by Finite Automata
- Characterization of \(\omega\)-regular languages by first-order formulas
- Structure Automata
- Init and Anf operating on \(\omega\)-languages
- Language operators related to Init
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Strategical languages of infinite words
- A Theory of Formal Choreographic Languages
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Topology on words
- Subword Metrics for Infinite Words
- On Recognition of Shift Registers
- Languages obtained from infinite words
This page was built for publication: Infinite-word languages and continuous mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082087)
