Numeration systems, linear recurrences, and regular sets

DOI10.1007/3-540-55719-9_66MaRDI QIDQ5204309zbMATH OpenOpenAlexFDO

Authors Jeffrey 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 languagenumeration systemfinite automatonfinite union

Mathematics Subject Classification ID

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

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 -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

Cites work

• scientific article; zbMATH DE number 3808979 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 3986648 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3528170 (Why is no real title available?)
• A generalization of automatic sequences
• Closure properties of slender languages
• Conditional recurrent sequences
• Fibonacci representations and finite automata
• Language-theoretic problems arising from Richelieu cryptosystems
• Linear numeration systems of order two
• Linear numeration systems, \(\theta\)-developments and finite automata
• On a Problem of Partitions
• Representations of numbers and finite automata
• Star height of certain families of regular events
• Systems of Numeration
• Thin and slender languages

Cited in

(12)

• scientific article; zbMATH DE number 4037858 (Why is no real title available?)
• Affinely recursive sets and orderings of languages.
• Linear numeration systems and \(\theta\)-representations
• On multiplicatively dependent linear numeration systems, and periodic points
• Numeration and enumeration
• Bertrand numeration systems and recognizability
• On the successor function in non-classical numeration systems
• Query automata over finite trees
• Pm numbers, ambiguity, and regularity
• Redundancy of minimal weight expansions in Pisot bases
• On the sequentiality of the successor function
• Some linear recurrences and their combinatorial interpretation by means of regular languages

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)