Cut languages in rational bases
From MaRDI portal
Recommendations
- Quasi-periodic \(\beta\)-expansions and cut languages
- Regularity of languages defined by formal series with isolated cut point
- On sets of numbers rationally represented in a rational base number system
- On the representation of real numbers using regular languages
- Algebraic properties on the cuts of lattice-valued regular languages
Cites work
- Analog computation via neural networks
- Computational power of neural networks: a characterization in terms of Kolmogorov complexity
- Cut languages in rational bases
- Efficient simulation of finite automata by neural nets
- Expansions in non-integer bases: lower, middle and top orders
- Expansions of real numbers in non-integer bases
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- scientific article; zbMATH DE number 1260390 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On Periodic Expansions of Pisot Numbers and Salem Numbers
- On the computational power of neural nets
- On theβ-expansions of real numbers
- Optimal simulation of automata by neural nets
- Periodic unique beta-expansions: the Sharkovskiĭ ordering
- Rational numbers with purely periodic β -expansion
- Representations for real numbers and their ergodic properties
- Subexpansions, superexpansions and uniqueness properties in non-integer bases
- Theory of neuromata
- Unique representations of real numbers in non-integer bases
Cited in
(3)
This page was built for publication: Cut languages in rational bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739007)
