Fibonacci representations and finite automata

DOI10.1109/18.75263zbMath0716.68067OpenAlexW2049878792MaRDI QIDQ3204057

Christiane Frougny

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.75263

zbMATH Keywords

numeration systemfinite-state automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (12)

Associativity of recurrence multiplication ⋮ A class of adding machines and Julia sets ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Deterministic synchronization of automata with bounded delay ⋮ Numeration systems, linear recurrences, and regular sets ⋮ Unnamed Item ⋮ A Fibonacci analogue of the two’s complement numeration system ⋮ Confluent linear numeration systems ⋮ Some combinatorics from Zeckendorf representations ⋮ Combinatorial and probabilistic properties of systems of numeration ⋮ A construction on finite automata that has remained hidden ⋮ A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser

This page was built for publication: Fibonacci representations and finite automata