Drunken man infinite words complexity
From MaRDI portal
Publication:3526419
DOI10.1051/ITA:2008012zbMATH Open1188.68217OpenAlexW2148256950MaRDI QIDQ3526419FDOQ3526419
Authors: Marion Le Gonidec 
Publication date: 25 September 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92890
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15) Automata sequences (11B85)
Cites Work
- The Kolmogorov complexity of infinite words
- Automatic Sequences
- Title not available (Why is that?)
- Uniform tag sequences
- Complexity and special factors
- On the arithmetic structure of sets characterized by sum of digits properties
- On the complexity of infinite sequences
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Complexity of sequences and dynamical systems
- Title not available (Why is that?)
- Substitution dynamical systems on infinite alphabets
- Arithmetics properties of substitutions and infinite automata
- Integers with an average sum of digits
- On the complexity of infinite words generated by countable \(q\)-automata
Cited In (7)
- On the complexity of infinite words generated by countable \(q\)-automata
- Behavior of various complexity functions
- On complexity functions of infinite words associated with generalized Dyck languages
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- Properties and limits of recognition of sets of integers by countable automata
- On the complexity of a family of \(k\)-context-free sequences
- Morphisms on infinite alphabets, countable states automata and regular sequences
This page was built for publication: Drunken man infinite words complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526419)
