scientific article; zbMATH DE number 3566723
From MaRDI portal
Publication:4138628
Cited in
(21)- The topological structure of adherences of regular languages
- Infinite Iterated Function Systems
- Infinite behaviour of Petri nets
- First-order and counting theories ofω-automatic structures
- Finite acceptance of infinite words
- Iterated function systems and control languages
- Valuations, regular expressions, and fractal geometry
- Sequential mappings of $\omega $-languages
- \(X\)-automata on \(\omega\)-words
- On the continuity set of an Omega rational function
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Decidability of code properties
- Topology on words
- Prefix-free languages as \(\omega\)-generators
- On infinitary finite length codes
- Finite-state \(\omega\)-languages
- Fractals, dimension, and formal languages
- On syntactic congruences for \(\omega\)-languages
- Stability for the zigzag submonoids
- Rebootable and suffix-closed $\omega $-power languages
- 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 Q4138628)