Download:
|
by Christoph Karg, Abteilung Theoretische Informatik
ftp://theorie.informatik.uni-ulm.de/pub/papers/ti/lrktesting.ps.gz
Add To MetaCart
Abstract:
In this note, we show that LR(k) testing of context-free grammars with respect to random instances is many-one complete for DistNP (Distributional NP). The same result holds for testing whether a context-free grammar is LL(k), strong LL(k), SLR(k), LC(k) or strong LC(k), respectively. 1
Citations
|
2770
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
1587
|
Computational Complexity
– Papadimitriou
- 1994
|
|
159
|
Structural Complexity I
– Balc'azar, D'iaz, et al.
- 1988
|
|
153
|
Average case complete problems
– Levin
- 1986
|
|
85
|
On the theory of average case complexity
– Ben-David, Chor, et al.
- 1992
|
|
38
|
Structural Complexity II
– Balcazar, Diaz, et al.
- 1990
|
|
32
|
Average-case computational complexity theory
– Wang
- 1997
|
|
27
|
Computational complexity of real functions
– Ko, Friedman
- 1982
|
|
20
|
Average time analysis of simplified Davis-Putnam procedures
– Goldberg, Purdom, et al.
- 1982
|
|
18
|
An O(1) expected time algorithm for the graph coloring problem
– Wilf
- 1984
|
|
16
|
Average case complexity
– Gurevich
- 1991
|
|
12
|
Average-case completeness of a word problem for groups
– Wang
- 1995
|
|
11
|
On the NP-isomorphism problem with respect to random instances
– Wang, Belanger
- 1995
|
|
9
|
Structural average case complexity
– Schuler, Yamakami
- 1992
|
|
5
|
On the complexity of LR(k) testing
– Szymanski, Ullman
- 1975
|
|
3
|
The Theory of Parsing, Translation, and Compiling: Vol
– Aho, Ullman
- 1972
|
|
3
|
Problems, complete in "average" instance
– Levin
- 1984
|
|
2
|
On average P vs. average NP
– Wang, Belanger
- 1993
|
