Normality and two-way automata

DOI10.1016/j.ic.2015.02.001zbMath1309.68116OpenAlexW1990986068MaRDI QIDQ2343136

Olivier Carton, Pablo Ariel Heiber

Publication date: 4 May 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.02.001

zbMATH Keywords

normal numberscompressiontwo-way automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (7)

A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Finite-state independence and normal sequences ⋮ Normal Numbers and Computer Science ⋮ Normality and automata ⋮ Finite-state independence ⋮ Preservation of normality by non-oblivious group selection ⋮ On normality in shifts of finite type

Cites Work

• Unnamed Item
• Unnamed Item
• Finite-state dimension
• Normal numbers and finite automata
• Selection functions that do not preserve normality
• Endliche Automaten und Zufallsfolgen
• Expressiveness of Streaming String Transducers
• The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
• The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
• MSO definable string transductions and two-way finite-state transducers
• A general theory of translation

This page was built for publication: Normality and two-way automata