TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR...

International Journal of Foundations of Computer Science 2013 / 12 Vol. 24; Iss. 8

TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES

YAKARYILMAZ, ABUZER, CEM SAY, A. C.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
24
Language:
english
Journal:
International Journal of Foundations of Computer Science
DOI:
10.1142/S0129054113500329
Date:
December, 2013
File:
PDF, 192 KB
english, 2013
Conversion to is in progress
Conversion to is failed