ON LLP(K) GRAMMARS AND LANGUAGESPITTL J.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 149-175; BIBL. 20 REF.Article

EXPONENTIAL OPTIMIZATION FOR THE LLP(K) PARSING METHOD.PITTL J.1977; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1977; NO 53; PP. 435-442; BIBL. 12 REF.; (MATH. FOUND. COMPUT. SCI. 1977. SYMP. 6. PROC.; TATRANSKA LOMNICA; 1977)Conference Paper

CHARACTERIZATIONS OF STACK UNIFORM STRICT DETERMINISTIC LANGUAGESPITTL J.1981; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1981; VOL. 17; NO 3; PP. 209-221; BIBL. 11 REF.Article

ON LLP (K) PARSERSPITTL J.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 36-68; BIBL. 21 REF.Article

CONSTRUCTING A REALTIME DETERMINISTIC PUSHDOWN AUTOMATON FROM A GRAMMARPITTL J; YEHUDAI A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 57-69; BIBL. 12 REF.Article