Magic Numbers in Periodic Sequences
From MaRDI portal
Publication:6134875
DOI10.1007/978-3-031-33180-0_16arXiv2304.03268OpenAlexW4381303882MaRDI QIDQ6134875
Savinien Kreczman, Eric S. Rowland, Manon Stipulanti, Luca Prigioniero
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.03268
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ring of \(k\)-regular sequences
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- Minimal DFA for testing divisibility
- Magic numbers in the state hierarchy of finite automata
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
- MAGIC NUMBERS AND TERNARY ALPHABET
- Weak Second‐Order Arithmetic and Finite Automata
- Deterministic blow-ups of minimal NFA's
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- The crystallographic restriction in higher dimensions
- A decision method for the recognizability of sets defined by number systems
- Automatic Sequences
- Decision Problems for Linear Recurrence Sequences
- An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
- Uniform tag sequences
- Complexity of automatic sequences
This page was built for publication: Magic Numbers in Periodic Sequences