Infinite-word languages and continuous mappings
From MaRDI portal
Publication:1082087
DOI10.1016/0304-3975(86)90166-0zbMath0602.68059OpenAlexW2087465671MaRDI QIDQ1082087
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)
Related Items (6)
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Subword Metrics for Infinite Words ⋮ A Theory of Formal Choreographic Languages ⋮ Topology on words ⋮ On Recognition of Shift Registers ⋮ Shift-invariant topologies for the Cantor space \(X^{\omega}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on non-algebraic adherences
- Finite-state \(\omega\)-languages
- Characterization of \(\omega\)-regular languages by first-order formulas
- A note on \(\omega\)-regular languages
- Init and Anf operating on \(\omega\)-languages
- Adherences of languages
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Language operators related to Init
- Fixed-point characterization of context-free ∞-languages
- On ω-regular sets
- A combinatorial approach to the theory of ω-automata
- Structure Automata
- Data Types as Lattices
- Star-free regular sets of ω-sequences
- Sets of Numbers Defined by Finite Automata
- Solving Sequential Conditions by Finite-State Strategies
- Decision problems forω-automata
- Definability in the monadic second-order theory of successor
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Infinite-word languages and continuous mappings
