On the factors of the Thue-Morse word on three symbols
Information Processing Letters
The Sprague-Grundy function for Wythoff's game
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Numeration systems, linear recurrences, and regular sets
Information and Computation
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Open questions around Bu¨chi and Presburger arithmetics
Logic: from foundations to applications
Bertrand numeration systems and recognizability
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Handbook of formal languages, vol. 1
On the sequentiality of the successor function
Information and Computation
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
Automata, Languages, and Machines
Automata, Languages, and Machines
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
More on generalized automatic sequences
Journal of Automata, Languages and Combinatorics
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés
Proceedings of the 11th Colloquium on Automata, Languages and Programming
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Complexity, appeal and challenges of combinatorial games
Theoretical Computer Science - Algorithmic combinatorial game theory
Distribution results for low-weight binary representations for pairs of integers
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Minimal DFA for testing divisibility
Journal of Computer and System Sciences
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
On the hartmanis-stearns problem for a class of tag machines
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Note: On the simplification of infinite morphic words
Theoretical Computer Science
A generalization of Cobham's theorem to automata over real numbers
Theoretical Computer Science
A Generalization of Semenov's Theorem to Automata over Real Numbers
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Elements of Automata Theory
Extensions and restrictions of Wythoff's game preserving its P positions
Journal of Combinatorial Theory Series A
Theoretical Computer Science
Combinatorics, Automata and Number Theory
Combinatorics, Automata and Number Theory
Complementary Iterated Floor Words and the Flora Game
SIAM Journal on Discrete Mathematics
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
| Hi-index | 0.00 |
We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal interpretations and some research directions. We discuss the notion of numeration systems, recognizable sets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and verification of infinite-state systems and present a list of open problems.