✦ LIBER ✦

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

✍ Scribed by Wojciech Rytter

Book ID: 113383839
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 597 KB
Volume: 73
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90041-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the parallel recognition of unambiguo

On the parallel recognition of unambiguous context-free languages

✍ Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Observations on log (n) time parallel re

Observations on log (n) time parallel recognition of unambiguous cfl's

✍ Peter Rossmanith; Wojciech Rytter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Efficient parallel recognition of contex

Efficient parallel recognition of context-free languages

✍ Abhay Jain; N.S. Chaudhari 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Recognition and parsing of context-free

Recognition and parsing of context-free languages in time n3

✍ Daniel H. Younger 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 976 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.

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