Cut Languages in Rational Bases

DOI10.1007/978-3-319-53733-7_23zbMath1485.68146OpenAlexW2588088081MaRDI QIDQ5739007

Petr Savický, Jiří Šíma

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_23

zbMATH Keywords

grammarscut languagequasi-periodic power series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Quasi-periodic \(\beta\)-expansions and cut languages ⋮ Cut Languages in Rational Bases

Cites Work

• Unnamed Item
• Unnamed Item
• Expansions in non-integer bases: lower, middle and top orders
• Analog computation via neural networks
• Subexpansions, superexpansions and uniqueness properties in non-integer bases
• On the computational power of neural nets
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Periodic unique beta-expansions: the Sharkovskiĭ ordering
• Rational numbers with purely periodic β -expansion
• EXPANSIONS OF REAL NUMBERS IN NON-INTEGER BASES
• 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
• Optimal simulation of automata by neural nets
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Cut Languages in Rational Bases
• Unique representations of real numbers in non-integer bases

This page was built for publication: Cut Languages in Rational Bases