✦ LIBER ✦

Recognition and parsing of context-free languages in time n3

✍ Scribed by Daniel H. Younger

Book ID: 114036568
Publisher: Elsevier Science
Year: 1967
Weight: 976 KB
Volume: 10
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(67)80007-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generation, recognition and parsing of c

Generation, recognition and parsing of context-free languages by means of recursive graphs

✍ F. P. Kaminger 📂 Article 📅 1973 🏛 Springer Vienna 🌐 English ⚖ 550 KB

Parallel time O(log n) recognition of un

Parallel time O(log n) recognition of unambiguous context-free languages

✍ Wojciech Rytter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 597 KB

Fast recognition of pushdown automaton a

Fast recognition of pushdown automaton and context-free languages

✍ Wojciech Rytter 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 474 KB

Hierarchies of context-free languages wi

Hierarchies of context-free languages with respect to their recognition times

✍ M. K. Valiev; A. Ya. Dikovskii 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 587 KB

Speed of Recognition of Context-Free Lan

Speed of Recognition of Context-Free Languages by Array Automata

✍ Kosaraju, S. Rao 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 869 KB

Almost optimal sublinear time parallel r

Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages

✍ Lawrence L. Larmore; Wojciech Rytter 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 803 KB

Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages (unambiguous, deterministic and linear) are presented. Optimality is measured with respect to the work of the best-known sequential algorithm for a given problem.