Name
Abstract | ||
|---|---|---|
>0) v is nonemptyc) uviwxiy is in L for all i 0This simplification seems to be unobserved in standard textbooks [Ha78] [HU79] [LP81] [Su88],and sometimes reduces the number of cases for students to consider when proving a language isnot context-free.References |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1145/156063.156066 | ACM SIGACT News |
Keywords | Field | DocType |
context-free language,context free language | Theoretical computer science,Pumping lemma for regular languages,Pumping lemma for context-free languages,Mathematics | Journal |
Volume | Issue | Citations |
24 | 2 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Don Colton | 1 | 5 | 2.11 |