Recommendations
Cites work
- scientific article; zbMATH DE number 177152 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3383900 (Why is no real title available?)
- An unpredictability approach to finite-state randomness
- Determinization of transducers over infinite words: The general case
- Distribution modulo one and Diophantine approximation
- Elements of automata theory. Translated from the French by Reuben Thomas
- Endliche Automaten und Zufallsfolgen
- Finite-state dimension
- Normal numbers and finite automata
- Normality and two-way automata
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Selection functions that do not preserve normality
- Unambiguous Büchi automata.
Cited in
(18)- Continued fraction normality is not preserved along arithmetic progressions
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78
- Non-trivial matrix actions preserve normality for continued fractions
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Normality and two-way automata
- Mathematical Foundations of Computer Science 2003
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Deterministic pushdown automata can compress some normal sequences
- Normal numbers and finite automata
- Preservation of normality by non-oblivious group selection
- Preservation of normality by unambiguous transducers
- Normalization of Some Extended Abstract State Machines
- Finite-state independence
- Normal numbers and computer science
- On normality in shifts of finite type
- Preservation of normality by transducers
- Finite-state independence and normal sequences
- Selection rules preserving normality
This page was built for publication: Normality and automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494059)
