Numeration systems, linear recurrences, and regular sets

DOI10.1007/3-540-55719-9_66zbMath1425.11015OpenAlexW1600484659MaRDI QIDQ5204309

Jeffrey O. Shallit

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

zbMATH Keywords

regular languagefinite automatonnumeration systemfinite union

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recurrences (11B37) Automata sequences (11B85) Other number representations (11A67)

Related Items (3)

On the sequentiality of the successor function ⋮ Bertrand numeration systems and recognizability ⋮ Query automata over finite trees

Cites Work

• Language-theoretic problems arising from Richelieu cryptosystems
• Linear numeration systems of order two
• A generalization of automatic sequences
• Conditional recurrent sequences
• Closure properties of slender languages
• Thin and slender languages
• Star height of certain families of regular events
• Fibonacci representations and finite automata
• Systems of Numeration
• Representations of numbers and finite automata
• Linear numeration systems, θ-developments and finite automata
• On a Problem of Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numeration systems, linear recurrences, and regular sets