Proving Properties of \varphi-Representations with the Walnut Theorem-Prover
From MaRDI portal
Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover
Abstract: We revisit a classic theorem of Frougny and Sakarovitch concerning automata for -representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of existing results in the literature about these representations, in a uniform and straightforward manner. In particular, we can easily and "automatically recover many of the results of recent papers of Dekking and Van Loon. We also obtain a number of new results on -representations.
This page was built for publication: Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435288)
