Pages that link to "Item:Q1333266"

The following pages link to Numeration systems, linear recurrences, and regular sets (Q1333266):

Displaying 50 items.

• Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
• Numeration and enumeration (Q444411) (← links)
• Real numbers having ultimately periodic representations in abstract numeration systems (Q598243) (← links)
• Linear relations between pattern sequences in a \(\langle q, r\rangle\)-numeration system (Q663284) (← links)
• Periodic and Sturmian languages (Q844208) (← links)
• Odometers on regular languages (Q866909) (← links)
• The self-affine property of \((U,r)\)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS (Q967444) (← links)
• Decimations of languages and state complexity (Q1019721) (← links)
• Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
• Linear numeration systems and \(\theta\)-representations (Q1190473) (← links)
• On number systems with finite degree of ambiguity (Q1271465) (← links)
• On the sequentiality of the successor function (Q1383150) (← links)
• The single loop representations of regular languages (Q1383380) (← links)
• Greedy numeration systems and regularity (Q1386650) (← links)
• On lengths of words in context-free languages (Q1575557) (← links)
• Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
• Construction of regular languages and recognizability of polynomials (Q1613560) (← links)
• Ostrowski numeration systems, addition, and finite automata (Q1750300) (← links)
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
• Self-generating sets, integers with missing blocks, and substitutions (Q1773352) (← links)
• Decidability questions related to abstract numeration systems (Q1877679) (← links)
• \(\beta\)-shift, numeration systems, and automata (Q1910684) (← links)
• Automatic sequences based on Parry or Bertrand numeration systems (Q2002037) (← links)
• Synchronized sequences (Q2140455) (← links)
• A full characterization of Bertrand numeration systems (Q2163984) (← links)
• The carry propagation of the successor function (Q2197902) (← links)
• Hairpin structures defined by DNA trajectories (Q2272214) (← links)
• Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions (Q2316287) (← links)
• On \(\alpha \)-greedy expansions of numbers (Q2381829) (← links)
• Sparse and slender subsets of monoids. (Q2480765) (← links)
• The critical exponent is computable for automatic sequences (Q2789533) (← links)
• A probabilistic approach to generalized Zeckendorf decompositions (Q2813348) (← links)
• On Lazy Representations and Sturmian Graphs (Q3073629) (← links)
• Pm numbers, ambiguity, and regularity (Q3142275) (← links)
• Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems (Q3599131) (← links)
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
• (Q3778018) (← links)
• A characterization of poly-slender context-free languages (Q4494483) (← links)
• On multiplicatively dependent linear numeration systems, and periodic points (Q4800260) (← links)
• 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 (Q4923560) (← links)
• The State Complexity of Lexicographically Smallest Words and Computing Successors (Q5041251) (← links)
• Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
• Radix enumeration of rational languages (Q5190076) (← links)
• Numeration systems, linear recurrences, and regular sets (Q5204309) (← links)
• Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
• THE BASE PROBLEM FOR D0L PARIKH SETS (Q5291307) (← links)
• Répartition jointe dans les classes de résidus de la somme des chiffres pour deux représentations d’Ostrowski (Q5864314) (← links)
• On Parikh slender context-free languages (Q5941095) (← links)
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)