Optimal on-line simulations of tree machines by random access machines

Optimal on-line simulations of tree machines by random access machines

This paper shows that every tree machine of time complexity $t$ can be simulated on-line by a log-cost random access machine (RAM) of time complexity $O((t\log t)/\log \log t)$. Using information-theoretic techniques, it is shown that this simulation is optimal. It is also shown that every tree mach...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1992-10, Vol.21 (5), p.959-971
Hauptverfasser: LOUI, M. C, LUGINBUHL, D. R
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computer engineering
Computer science
control theory
systems
Exact sciences and technology
Load
Simulation
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper shows that every tree machine of time complexity $t$ can be simulated on-line by a log-cost random access machine (RAM) of time complexity $O((t\log t)/\log \log t)$. Using information-theoretic techniques, it is shown that this simulation is optimal. It is also shown that every tree machine can be simulated by a unit-cost RAM in real time.
ISSN:0097-5397
1095-7111
DOI:10.1137/0221056