Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Dynamical aspects of cellular automata (37B15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Multidimensional shifts of finite type (37B51)
Abstract: In this paper we consider the notion of normality of sequences in shifts of finite type. A sequence is normal if the frequency of each block exists and is equal to the Parry measure of the block. We give a characterization of normality in terms of incompressibility by lossless transducers. The result was already known in the case of the full shift.
Recommendations
Cites work
- scientific article; zbMATH DE number 3745547 (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 Introduction to Symbolic Dynamics and Coding
- Compression of individual sequences via variable-rate coding
- Distribution modulo one and Diophantine approximation
- Endliche Automaten und Zufallsfolgen
- Finite-state dimension
- Markov Chains
- Non-negative matrices and Markov chains.
- Normal numbers
- Normal numbers and finite automata
- Normal numbers and symbolic dynamics
- Normality and automata
- Normality and two-way automata
- Normality in non-integer bases and polynomial time randomness
- On a paper of Niven and Zuckerman
- Sofic systems and graphs
- Subshifts of finite type and sofic systems
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
Cited in
(5)
This page was built for publication: On normality in shifts of finite type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778523)
