Numeration systems, linear recurrences, and regular sets
From MaRDI portal
Publication:1333266
DOI10.1006/inco.1994.1076zbMath0810.11006OpenAlexW2045761215MaRDI QIDQ1333266
Publication date: 12 October 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/64fce1366c11c5d248567d4e43f8ab9bb59ec82a
Related Items (42)
Decidability questions related to abstract numeration systems ⋮ The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ THE BASE PROBLEM FOR D0L PARIKH SETS ⋮ On multiplicatively dependent linear numeration systems, and periodic points ⋮ Synchronized sequences ⋮ Periodic and Sturmian languages ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ Ultimate periodicity problem for linear numeration systems ⋮ \(\beta\)-shift, numeration systems, and automata ⋮ A full characterization of Bertrand numeration systems ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ The single loop representations of regular languages ⋮ Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508 ⋮ Sturmian graphs and integer representations over numeration systems ⋮ The carry propagation of the successor function ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ Ostrowski numeration systems, addition, and finite automata ⋮ Sparse and slender subsets of monoids. ⋮ Automatic sequences based on Parry or Bertrand numeration systems ⋮ The self-affine property of \((U,r)\)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS ⋮ On Parikh slender context-free languages ⋮ It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base ⋮ Self-generating sets, integers with missing blocks, and substitutions ⋮ Hairpin structures defined by DNA trajectories ⋮ Radix enumeration of rational languages ⋮ A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems ⋮ The Critical Exponent is Computable for Automatic Sequences ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ On Lazy Representations and Sturmian Graphs ⋮ A Probabilistic Approach to Generalized Zeckendorf Decompositions ⋮ Decimations of languages and state complexity ⋮ On number systems with finite degree of ambiguity ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions ⋮ On lengths of words in context-free languages ⋮ Generalization of automatic sequences for numeration systems on a regular language ⋮ Detecting palindromes, patterns and borders in regular languages ⋮ A characterization of poly-slender context-free languages ⋮ Répartition jointe dans les classes de résidus de la somme des chiffres pour deux représentations d’Ostrowski ⋮ Pm numbers, ambiguity, and regularity
This page was built for publication: Numeration systems, linear recurrences, and regular sets
