Numeration systems, linear recurrences, and regular sets
From MaRDI portal
Publication:5204309
DOI10.1007/3-540-55719-9_66zbMATH Open1425.11015OpenAlexW1600484659MaRDI QIDQ5204309FDOQ5204309
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_66
Recommendations
- Numeration systems, linear recurrences, and regular sets
- scientific article; zbMATH DE number 3988675
- Combinatorial and arithmetical properties of linear numeration systems
- On the variety of linear recurrences and numerical semigroups
- scientific article; zbMATH DE number 672017
- Linear numeration systems and \(\theta\)-representations
- scientific article; zbMATH DE number 508846
- Greedy numeration systems and regularity
- Regular sequences and synchronized sequences in abstract numeration systems
- scientific article; zbMATH DE number 936375
Formal languages and automata (68Q45) Other number representations (11A67) Recurrences (11B37) Automata sequences (11B85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a Problem of Partitions
- Title not available (Why is that?)
- Systems of Numeration
- Fibonacci representations and finite automata
- A generalization of automatic sequences
- Title not available (Why is that?)
- Representations of numbers and finite automata
- Linear numeration systems, θ-developments and finite automata
- Closure properties of slender languages
- Thin and slender languages
- Language-theoretic problems arising from Richelieu cryptosystems
- Title not available (Why is that?)
- Star height of certain families of regular events
- Linear numeration systems of order two
- Conditional recurrent sequences
- Title not available (Why is that?)
Cited In (10)
- Affinely recursive sets and orderings of languages.
- Bertrand numeration systems and recognizability
- Title not available (Why is that?)
- Some linear recurrences and their combinatorial interpretation by means of regular languages
- On the sequentiality of the successor function
- Query automata over finite trees
- On multiplicatively dependent linear numeration systems, and periodic points
- Pm numbers, ambiguity, and regularity
- Linear numeration systems and \(\theta\)-representations
- Redundancy of minimal weight expansions in Pisot bases
This page was built for publication: Numeration systems, linear recurrences, and regular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204309)
