Quasi-periodic \(\beta\)-expansions and cut languages

DOI10.1016/j.tcs.2018.02.028zbMath1388.68180OpenAlexW2793617150MaRDI QIDQ1704578

Jiří Šíma, Petr Savický

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.028

zbMATH Keywords

quasi-periodicityChomsky hierarchyPisot number\(\beta\)-expansioncut language

Mathematics Subject Classification ID

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

Related Items (4)

Subrecursive neural networks ⋮ Three analog neurons are Turing universal ⋮ Analog neuron hierarchy ⋮ Periodic representations in Salem bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comments on the height reducing property. II
• Generalized golden ratios of ternary alphabets
• Number representation using generalized \((-\beta )\)-transformation
• Expansions in non-integer bases: lower, middle and top orders
• Unique expansions of real numbers
• Analog computation via neural networks
• Critical bases for ternary alphabets
• Greedy expansions and sets with deleted digits
• On the computational power of neural nets
• On periodic representations in non-Pisot bases
• Intersections of homogeneous Cantor sets and beta-expansions
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Periodic unique beta-expansions: the Sharkovskiĭ ordering
• Theory of neuromata
• On Periodic Expansions of Pisot Numbers and Salem Numbers
• Efficient simulation of finite automata by neural nets
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• Almost Every Number Has a Continuum of b-Expansions
• Optimal simulation of automata by neural nets
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Energy Complexity of Recurrent Neural Networks
• Negative bases and automata
• Generalised golden ratios over integer alphabets
• Cut Languages in Rational Bases
• Characterization of the unique expansions $1=\sum^{\infty}_{i=1}q^{-n_ i}$ and related problems
• Number fields
• Unique representations of real numbers in non-integer bases

This page was built for publication: Quasi-periodic \(\beta\)-expansions and cut languages