|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
10th Annual Symposium on Switching and Automata Theory (SWAT 1969)
Table machine simulation
October 15-October 17
| ASCII Text | x | ||
| R. E. Stearns, D. J. Rosenkrantz, "Table machine simulation," Foundations of Computer Science, IEEE Annual Symposium on, pp. 118-128, 10th Annual Symposium on Switching and Automata Theory (SWAT 1969), 1969. | |||
| BibTex | x | ||
| @article{ 10.1109/SWAT.1969.24, author = {R. E. Stearns and D. J. Rosenkrantz}, title = {Table machine simulation}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1969}, issn = {0272-4847}, pages = {118-128}, doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1969.24}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Table machine simulation SN - 0272-4847 SP118 EP128 A1 - R. E. Stearns, A1 - D. J. Rosenkrantz, PY - 1969 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1969.24
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.
Citation:
R. E. Stearns, D. J. Rosenkrantz, "Table machine simulation," focs, pp.118-128, 10th Annual Symposium on Switching and Automata Theory (SWAT 1969), 1969
Usage of this product signifies your acceptance of the Terms of Use.