Automata and algebraicity
From MaRDI portal
Publication:2388603
DOI10.5802/jtnb.472zbMath1119.11020OpenAlexW2315142413MaRDI QIDQ2388603
Publication date: 15 September 2005
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_2005__17_1_1_0
Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70) Automata sequences (11B85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
- Transcendence of Thue-Morse continued fractions
- Substitution in two symbols and transcendence
- Transcendence of numbers with a low complexity expansion
- On the transcendence of real numbers with a regular expansion.
- Transcendence of Sturmian or morphic continued fractions
- Simultaneous approximation to a real number and its square
- Some classes of transcendental numbers
- Suites algébriques, automates et substitutions
- Arithmetic properties of certain functions in several variables III
- Automatic Sequences
- Approximation to real numbers by cubic algebraic integers I
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
This page was built for publication: Automata and algebraicity
