Recursive information transducers: Computation models

DOI10.1007/BF02666995zbMath0947.68533MaRDI QIDQ1288659

Anatoly V. Anisimov

Publication date: 16 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items

Recursive information transducers: Computation models ⋮ Quantum model of computations: Underlying principles and achievements

Cites Work

• Modeling recursion with the aid of iterative algorithms
• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Recursive information transducers: Computation models
• Iteration strikes back - at the cyclic Towers of Hanoi
• Eliminating Redundant Recursive Calls.
• Programming of parallel processors in control spaces
• Church-Rosser converters
• Discussion and correspondence: A note on the Towers of Hanoi problem
• Program Schemes with Pushdown Stores
• Quantum complexity theory
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item