Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nijholt, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On satisfying the LL-iteration theorem
A. Nijholt
Theoretical Computer Science
23
(1), 1983, pp. 91-94
On the relationship between the LL(k) and LR(k) grammars
A. Nijholt
Information Processing Letters
15
(3), 1982, October, pp. 97-101
A note on the sufficiency of Sokolowski's criterion for context-free languages
A. Nijholt
Information Processing Letters
14
(5), 1982, July, pp. 207
The equivalence problem for LL- and LR-regular grammars
A. Nijholt
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 149-161
A survey of normal form covers for context free grammars
A. Nijholt
Acta Informatica
14
(3), 1980, September, pp. 271-294
From left-regular to Greibach normal form grammars
A. Nijholt
Information Processing Letters
9
(1), 1979, July, pp. 51-55
Structure preserving transformations on non-left-recursive grammars
A. Nijholt
Lecture Notes in Computer Science
71
, 1979, pp. 446-459
Simple chain grammars and languages
A. Nijholt
Theoretical Computer Science
9
(3), 1979, pp. 287-309
On the parsing and covering of simple chain grammars
A. Nijholt
Lecture Notes in Computer Science
62
, 1978, pp. 330-344
On the covering of parsable grammars
A. Nijholt
Journal of Computer and System Sciences
15
(1), 1977, August, pp. 99-110