The topological structure of adherences of regular languages
From MaRDI portal
Publication:3747749
Recommendations
- On topological completeness of regular tree languages
- Complexity of topological properties of regular \(\omega\)-languages
- Complexity of Topological Properties of Regular ω-Languages
- scientific article; zbMATH DE number 3911732
- Topological properties of fuzzy regular languages
- On the topological complexity of tree languages
- On the boundary of regular languages
- On the boundary of regular languages
- Topological characterizations of infinite tree languages
- Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
Cites work
- scientific article; zbMATH DE number 3911732 (Why is no real title available?)
- scientific article; zbMATH DE number 3566723 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- scientific article; zbMATH DE number 3326329 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Adherences of languages
- Compact zero-dimensional metric spaces of finite type
- Finite-state \(\omega\)-languages
Cited in
(5)- The topologies of sofic subshifts have computable Pierce invariants
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Topology on words
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- scientific article; zbMATH DE number 3911732 (Why is no real title available?)
This page was built for publication: The topological structure of adherences of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747749)
