๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by M. K. Valiev; A. Ya. Dikovskii

Publisher
Springer US
Year
1976
Tongue
English
Weight
587 KB
Volume
11
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.