Title :
Table machine simulation
Author :
Stearns, R.E. ; Rosenkrantz, D.J.
Abstract :
A pushdown table machine can be simulated by a computer in time n log log n where n is the number of table machine operations. A finite state table machine can be simulated in linear time.
Keywords :
Algorithms; Computational modeling; Computer languages; Computer simulation; Corporate acquisitions; Production; Terminology;
Conference_Titel :
Switching and Automata Theory, 1969., IEEE Conference Record of 10th Annual Symposium on
Conference_Location :
Waterloo, ON, Canada
DOI :
10.1109/SWAT.1969.24
