Cut Languages in Rational Bases
We introduce a so-called cut language which contains the representations of numbers in a rational base that are less than a given threshold. The cut languages can be used to refine the analysis of neural net models between integer and rational weights. We prove a necessary and sufficient condition when a cut language is regular, which is based on the concept of a quasi-periodic power series. For a nonnegative base and digits, we achieve a dichotomy that a cut language is either regular or non-context-free while examples of regular and non-context-free cut languages are presented. We show that any cut language with a rational threshold is context-sensitive.
KeywordsGrammars Quasi-periodic power series Cut language
- 7.Hare, K.G.: Beta-expansions of Pisot and Salem numbers. In: Proceedings of the Waterloo Workshop in Computer Algebra 2006: Latest Advances in Symbolic Algorithms, pp. 67–84. World Scientic (2007)Google Scholar
- 22.Šíma, J.: Neural networks between integer and rational weights. Technical report, no. V-1237, Institute of Computer Science, The Czech Academy of Sciences, Prague (2016)Google Scholar
- 24.Šíma, J., Savický, P.: Cut languages in rational bases. Technical report, no. V-1236, Institute of Computer Science, The Czech Academy of Sciences, Prague (2016)Google Scholar