Technical Report CS0047

TR#:CS0047
Class:CS
Title: Theory of w-languages; Part II a Study of Various Models of w-type Generation And Recognition
Authors: Rina S.Cohen and Arie Y. Gold
PDFCS0047.pdf
Abstract: w-languages are sets consisting of w-length strings; w-automata are recognition devices for w-languages. In a previous papee the basic notions of w-grammars, w-context-free languages (w-CFL's) and w-pushdown automata (w-PDA's) were first defined and studied. In this paper various modes of w-type generation are introduced and the effect of certain restrictions on the derivations in w-grammars is investigated. Several distinct models of recognition in w-PDA's are considered, giving rise to a hierarchy of subfamilies of the w-CFL's. The relations among these su~families are established and characterizations for each family are dertved. Non-leftmost derivations in w-CFG's are studied and it is shown that l~ftmost generation in w-CFG's is strictly more powerful than non-leftmost generation.
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 (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1975/CS/CS0047), 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
admin