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.
โฆ LIBER โฆ
Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
โ Scribed by Alan Gibbons; Wojciech Rytter
- Book ID
- 113383904
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 823 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0890-5401
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Almost optimal sublinear time parallel r
โ
Lawrence L. Larmore; Wojciech Rytter
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 803 KB
Algorithm partition and parallel recogni
โ
H.D. Cheng; K.S. Fu
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 825 KB
Parallel asynchronous algorithms for opt
โ
S. S. Abdelwahed; M. F. Hassan; M. A. Sultan
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 153 KB
๐ 2 views
This paper presents two parallel asynchronous algorithms for the solution of the optimal control problem of linear large-scale dynamic systems. These algorithms are based on the prediction concept. The first one adopts the interaction prediction approach and the second is based upon the costate pred
Approximation and Exact Algorithms for R
โ
Tatsuya Akutsu
๐
Article
๐
1999
๐
Springer US
๐
English
โ 103 KB
THE COMPUTATIONAL COMPLEXITY OF THE UNIV
โ
Yuichi Kaji1; Ryuichi Nakanishi; Hiroyuki Seki1; Tadao Kasami
๐
Article
๐
1994
๐
John Wiley and Sons
๐
English
โ 778 KB
Method of multimodal biometric data anal
โ
V. V. Lobantsov; I. A. Matveev; A. B. Murynin
๐
Article
๐
2011
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 95 KB