Title :
On reversal complexity for alternating Turing machines
Author :
M. Liskiewicz;K. Lorys
Author_Institution :
Inst. of Comput. Sci., Wroclaw Univ., Poland
fDate :
6/11/1905 12:00:00 AM
Abstract :
The reversal complexity of alternating Turing machines (ATM) is investigated. The strict lower bounds on reversals for recognizing nonregular languages by Sigma /sub k/ machines are settled. Some results relating reversal and space complexities are obtained.
Keywords :
"Turing machines","Computational modeling","Computer science","Polynomials","Mathematical model","Concurrent computing","Complexity theory","Logic","Out of order","Computational complexity"
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Print_ISBN :
0-8186-1982-1
DOI :
10.1109/SFCS.1989.63544
