Normality and automata
DOI10.1016/J.JCSS.2015.04.007zbMATH Open1329.68156DBLPjournals/jcss/BecherCH15OpenAlexW612499105WikidataQ61927005 ScholiaQ61927005MaRDI QIDQ494059FDOQ494059
Authors: Verónica Becher, Olivier Carton, Pablo Ariel Heiber 
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
Recommendations
regular languagenondeterminismcounter transducerfinite-state transducernormal wordpushdown transducer
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Finite-state dimension
- Normal numbers and finite automata
- Selection functions that do not preserve normality
- Endliche Automaten und Zufallsfolgen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distribution modulo one and Diophantine approximation
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Title not available (Why is that?)
- Unambiguous Büchi automata.
- An unpredictability approach to finite-state randomness
- Determinization of transducers over infinite words: The general case
- Normality and two-way automata
- Title not available (Why is that?)
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)
