Normality and automata

DOI10.1016/j.jcss.2015.04.007zbMath1329.68156OpenAlexW612499105WikidataQ61927005 ScholiaQ61927005MaRDI QIDQ494059

Pablo Ariel Heiber, Olivier Carton, Verónica Becher

Publication date: 31 August 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.04.007

zbMATH Keywords

regular languagenondeterminismcounter transducerfinite-state transducernormal wordpushdown transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (9)

Continued fraction normality is not preserved along arithmetic progressions ⋮ A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Finite-state independence and normal sequences ⋮ Non-trivial matrix actions preserve normality for continued fractions ⋮ Normal Numbers and Computer Science ⋮ Finite-state independence ⋮ Preservation of normality by non-oblivious group selection ⋮ On normality in shifts of finite type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• An unpredictability approach to finite-state randomness
• Unambiguous Büchi automata.
• Determinization of transducers over infinite words: The general case
• Finite-state dimension
• Normal numbers and finite automata
• Normality and two-way automata
• Selection functions that do not preserve normality
• Endliche Automaten und Zufallsfolgen

This page was built for publication: Normality and automata