On normality in shifts of finite type

DOI10.1007/S00224-019-09953-9zbMath1458.37016arXiv1807.07208OpenAlexW2992189211MaRDI QIDQ778523

Olivier Carton, Nicolás Alvarez

Publication date: 2 July 2020

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.07208

zbMATH Keywords

normalitycompressionfinite-state transducerfull shiftfinite type shift

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Dynamical aspects of cellular automata (37B15) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Multidimensional shifts of finite type (37B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normality and automata
• Normal numbers
• Sofic systems and graphs
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Subshifts of finite type and sofic systems
• Finite-state dimension
• Normal numbers and finite automata
• Normality and two-way automata
• Normality in non-integer bases and polynomial time randomness
• Non-negative matrices and Markov chains.
• Endliche Automaten und Zufallsfolgen
• On a paper of Niven and Zuckerman
• Compression of individual sequences via variable-rate coding
• Markov Chains
• Normal Numbers and Symbolic Dynamics
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: On normality in shifts of finite type