Automata and continued fractions
From MaRDI portal
Publication:1311040
The author compares different continued fraction expansions of real numbers, to wit the usual `regular' expansion, an expansion employing odd partial quotients only (necessarily lying in \(\mathbb{Z}\) rather than, as usual in \(\mathbb{N}\)), and the efficient nearest integer expansion (which, once again requires negative partial quotients). Questions of interest touched upon include the formalism and complexity of transducing one kind of expansion to another.
Recommendations
- Finite automata and periodic decompositions of real numbers.
- Automatic continued fractions are transcendental or quadratic
- Description of Generalized Continued Fractions by Finite Automata
- On the automaticity of sequences defined by the Thue-Morse and period-doubling Stieltjes continued fractions
- Algebraic computations with continued fractions
Cites work
- Ein H<scp>EILBRONN</scp>‐Satz für Kettenbrüche mit ungeraden Teilnennern
- scientific article; zbMATH DE number 3875403 (Why is no real title available?)
- scientific article; zbMATH DE number 3752930 (Why is no real title available?)
- scientific article; zbMATH DE number 3797861 (Why is no real title available?)
Cited in
(5)- scientific article; zbMATH DE number 5799714 (Why is no real title available?)
- scientific article; zbMATH DE number 1254099 (Why is no real title available?)
- Finite automata and periodic decompositions of real numbers.
- A generalization of continued fractions
- Quadratic approximation to automatic continued fractions
This page was built for publication: Automata and continued fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311040)