scientific article; zbMATH DE number 891076

MaRDI QIDQ4880554zbMATH OpenFDO

Authors Christiane Frougny, B. Solomyak

Publication date 14 July 1996

zbMATH Keywords

finite two tape automatonlinear numeration systemslinear recurrence relationminimal polynomial of a Perron numbernormalizationPisot number

Mathematics Subject Classification ID

Other number representations (11A67) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)

Recommendations

• Linear numeration systems, -developments and finite automata
• Linear numeration systems and -representations
• Confluent linear numeration systems
• Representations of numbers and finite automata

Cited in

(39)

• Cubic pisot unit combinatorial games
• Linear numeration systems of order two
• Linear numeration systems and -representations
• Confluent linear numeration systems
• Independent numeration systems and syndeticity
• On the sequentiality of the successor function
• Bertrand numeration systems and recognizability
• Generalization of automatic sequences for numeration systems on a regular language
• Ostrowski numeration systems, addition, and finite automata
• Automatic sequences based on Parry or Bertrand numeration systems
• Robustness of Pisot-regular sequences
• Regular sequences and synchronized sequences in abstract numeration systems
• A full characterization of Bertrand numeration systems
• The carry propagation of the successor function
• Ostrowski-automatic sequences: theory and applications
• Abstract \(\beta\)-expansions and ultimately periodic representations
• Representing integers in the binary number system as permanents of certain matrices
• On positional representation of integer vectors
• scientific article; zbMATH DE number 4131672 (Why is no real title available?)
• scientific article; zbMATH DE number 2086219 (Why is no real title available?)
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Mechanical proofs of properties of the Tribonacci word
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
• First-order logic and numeration systems
• On multiplicatively dependent linear numeration systems, and periodic points
• Linear numeration systems, -developments and finite automata
• Recognizable sets of numbers in nonstandard bases
• Automata, Borel functions and real numbers in Pisot base
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• Real numbers having ultimately periodic representations in abstract numeration systems
• Properties of a ternary infinite word
• Numeration systems defined by addition rules
• A Fibonacci analogue of the two’s complement numeration system
• Automatic maps in exotic numeration systems
• Self-verifying predicates in Büchi arithmetic
• Linear recurrence sequence automata and the addition of abstract numeration systems
• Automatic proofs in combinatorial game theory
• Dumont-Thomas complement numeration systems for \(\mathbb{Z}\)
• Proof of Irvine's conjecture via mechanized guessing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880554)