scientific article
From MaRDI portal
Publication:3718171
zbMath0589.68053MaRDI QIDQ3718171
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Recurrences (11B37) Radix representation; digital problems (11A63)
Related Items
Combinatorial properties of Fibonacci partial words and arrays, Some properties of the Fibonacci sequence on an infinite alphabet, On-line finite automata for addition in some numeration systems, Linear numeration systems of order two, The structure of subword graphs and suffix trees of Fibonacci words, Caractérisation results about $L$ codes, Numeration systems, linear recurrences, and regular sets, Linear numeration systems, θ-developments and finite automata, Automaticity. II: Descriptional complexity in the unary case, Unnamed Item, Two-dimensional Fibonacci words: tandem repeats and factor complexity, Proving results about OEIS sequences with \texttt{Walnut}, Intriguing infinite words composed of zeros and ones, A Fibonacci analogue of the two’s complement numeration system, Some properties of the \(k\)-bonacci words on infinite alphabet, Transduction of automatic sequences and applications, A generalization of the Fibonacci word fractal and the Fibonacci snowflake, Unnamed Item, Study of irreducible balanced pairs for substitutive languages, Look and Say Fibonacci, Decimations and sturmian words, On the conjugacy class of the Fibonacci dynamical system, Confluent linear numeration systems, Periodic words connected with the Fibonacci words, Parallel addition in non-standard numeration systems, On the complexity of Fibonacci coding, Global Fibonacci nim, On number systems with finite degree of ambiguity, Combinatorics on patterns of a bidimensional Sturmian sequence, Forbidden words in symbolic dynamics, Certain words on the real projective line, An estimation of phase transition *
