Technical Report CS0056

Title: Complexity of w-Computations On Oeterministic Pushdown Machines
Authors: Rina S.Cohen and Arie Y.Gold
Abstract: Deterministic pushdown machines working on w-tapes are considered. The w-languages recognized by such machines are called w-DCFL's. Various recognition mechanisms for w-sequences are considered, yielding a hierarchy of "i-recognizable" classes of w-DCFL's. i-recognizability of an w-language can be considered a measure of the complexity of the w-language. These "i-recognizable" classes are extensively studied and related to other classes of W-CFL's. Decision problems concerning these classes are investigated; in particular, for some of the classes the membership problem is shown to be decidable.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1975
To the main CS technical reports page

Computer science department, Technion