Parallel addition in non-standard numeration systems
From MaRDI portal
Publication:719312
DOI10.1016/j.tcs.2011.06.028zbMath1230.68220arXiv1102.5683OpenAlexW2024581566MaRDI QIDQ719312
Christiane Frougny, Milena Svobodová, Edita Pelantová
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.5683
Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)
Related Items (9)
On periodic representations in non-Pisot bases ⋮ On positional representation of integer vectors ⋮ Unnamed Item ⋮ On distinct unit generated fields that are totally complex ⋮ Alphabets, rewriting trails and periodic representations in algebraic bases ⋮ \(k\)-block parallel addition versus 1-block parallel addition in non-standard numeration systems ⋮ Periodic representations in algebraic bases ⋮ On the complexity of Fibonacci coding ⋮ Construction of algorithms for parallel addition in expanding bases via extending window method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Height reducing problem on algebraic integers
- Minimal weight expansions in Pisot bases
- On-line finite automata for addition in some numeration systems
- An Introduction to Symbolic Dynamics and Coding
- A ``Binary System for Complex Numbers
- Number representation and finite automata
This page was built for publication: Parallel addition in non-standard numeration systems