ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON

DOI10.1142/S0218196703001262zbMath1069.68047MaRDI QIDQ3043622

Lioudmila Pavlotskaïa, Maurice Margenstern

Publication date: 6 August 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

Turing machinesuniversalitydecidabilityfinite automata

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (6)

The Complexity of Small Universal Turing Machines: A Survey ⋮ A DNA computing inspired computational model ⋮ The complexity of small universal Turing machines: A survey ⋮ Surprising Areas in the Quest for Small Universal Devices ⋮ Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines ⋮ Computing by Floating Strings

Cites Work

• Unnamed Item
• On machines, universal by extensions
• Frontier between decidability and undecidability: A survey

This page was built for publication: ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON