Complexity of automatic sequences
From MaRDI portal
Publication:5918530
DOI10.1016/j.ic.2021.104710OpenAlexW3126486020MaRDI QIDQ5918530
Publication date: 13 October 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104710
Related Items (2)
Magic Numbers in Periodic Sequences ⋮ Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansion complexity and linear complexity of sequences over finite fields
- Learning regular sets from queries and counterexamples
- The Magma algebra system. I: The user language
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings
- Automatic Sequences
- Mix-Automatic Sequences
- Decidability and Enumeration for Automatic Sequences: A Survey
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES
- Uniform tag sequences
- Complexity of automatic sequences
This page was built for publication: Complexity of automatic sequences