IndexBrowse   BibliographiesMy selection
 Search: in   (word length ≥ 3)
       Login
References of Eberhard Bertsch   Download bibtex file Order by:   Type | Year
<< 2001 >> TOP
1 Add to my selection
Eberhard Bertsch and Mark-Jan Nederhof. Size/ Lookahead Tradeoff for LL(k)-Grammars. In Information Processing Letters, Vol. 80:125-129, 2001. URL [Abstract]   Bibtex entry  google [Annote]
2 Add to my selection
Eberhard Bertsch and Mark-Jan Nederhof. On the Complexity of some Extensions of RCG Parsing. In Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19, Pages 66-77, Beijing, China, 2001. URL [Abstract]   Bibtex entry  google [Annote]
<< 1999 >> TOP
3 Add to my selection
Eberhard Bertsch and Mark-Jan Nederhof. On Failure of the Pruning Technique in Error Repair in Shift-Reduce Parsers. In ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 21(1):1-10, 1999. URL [Abstract]   Bibtex entry  google [Annote]
4 Add to my selection
Eberhard Bertsch and Mark-Jan Nederhof. Regular Closure of Deterministic Languages. In SIAM Journal on Computing, Vol. 29(1):81-102, 1999. URL [Abstract]   Bibtex entry  google [Annote]
5 Add to my selection
Mark-Jan Nederhof and Eberhard Bertsch. An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages. In A. Kornai editor, Extended Finite State Models of Language, Pages 226-243, Cambridge University Press, Stanford, 1999. URL   Bibtex entry  google [Annote]
Last modified: Thu October 16 2014 19:11:34         BibAdmin