NASA NTRS · 19730003454
Comparing complexity classes of formal languages
Abstract
A property of polynomial complete languages is extended in order to better compare various classes of formal languages defined by time- or tape-bounded turing machines.
Keep this discovery
Explore connections, maps & timelines
Book, R. V.. 1972-09-25. Comparing complexity classes of formal languages. https://ntrs.nasa.gov/citations/19730003454
Cite the original work for its findings. Save a collection to share your selection of sources.