Infinite-word languages and continuous mappings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 3814995 (Why is no real title available?)
- scientific article; zbMATH DE number 3707805 (Why is no real title available?)
- scientific article; zbMATH DE number 3716825 (Why is no real title available?)
- scientific article; zbMATH DE number 3725688 (Why is no real title available?)
- scientific article; zbMATH DE number 3471986 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3525042 (Why is no real title available?)
- scientific article; zbMATH DE number 3539162 (Why is no real title available?)
- scientific article; zbMATH DE number 3578343 (Why is no real title available?)
- scientific article; zbMATH DE number 3581219 (Why is no real title available?)
- scientific article; zbMATH DE number 3602692 (Why is no real title available?)
- scientific article; zbMATH DE number 3216679 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- scientific article; zbMATH DE number 3232606 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- A combinatorial approach to the theory of ω-automata
- A note on \(\omega\)-regular languages
- Adherences of languages
- Characterization of -regular languages by first-order formulas
- Data Types as Lattices
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision problems forω-automata
- Definability in the monadic second-order theory of successor
- Finite-state \(\omega\)-languages
- Fixed-point characterization of context-free ∞-languages
- Init and Anf operating on \(\omega\)-languages
- Language operators related to Init
- On ω-regular sets
- Sets of Numbers Defined by Finite Automata
- Solving Sequential Conditions by Finite-State Strategies
- Some remarks on non-algebraic adherences
- Star-free regular sets of ω-sequences
- Structure Automata
- Theories of automata on \(\omega\)-tapes: a simplified approach
Cited in
(15)- scientific article; zbMATH DE number 4028927 (Why is no real title available?)
- Subword metrics for infinite words
- Strategical languages of infinite words
- A Theory of Formal Choreographic Languages
- Sequential mappings of $\omega $-languages
- Shift-invariant topologies for the Cantor space \(X^{\omega}\)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Joint topologies for finite and infinite words
- Topology on words
- Topology on involutively bordered words
- Subword topology
- scientific article; zbMATH DE number 3845077 (Why is no real title available?)
- On Recognition of Shift Registers
- Languages obtained from infinite words
- Polishness of some topologies related to word or tree automata
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)