 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen  [2]
|
Hilfe 
|
 |
|
| Suche: Author="M{\"a}kinen, E." |
|
-
On the rotation distance of binary trees
E. Mäkinen
Information Processing Letters 26 (5), 1988, January, pp. 271-272 -
A note on pure grammars
E. Mäkinen
Information Processing Letters 23 (5), 1986, November, pp. 271-274 -
An undecidable problem for context-free grammars
E. Mäkinen
Information Processing Letters 20 (3), 1985, April, pp. 141-142 -
A note on undercover relation
E. Mäkinen
Information Processing Letters 20 (1), 1985, January, pp. 19-21 -
On derivation preservation (context-free grammars)
E. Mäkinen
Information Processing Letters 19 (5), 1984, November, pp. 225-228 -
Boundedness testing for unambiguous context-free grammars
E. Mäkinen
Information Processing Letters 17 (4), 1983, November, pp. 181-183
|
|
|