BibTeX
@inproceedings{DBLP:conf/fossacs/KnapikNU02,
author = {Teodor Knapik and
Damian Niwinski and
Pawel Urzyczyn},
title = {Higher-Order Pushdown Trees Are Easy},
booktitle = {FoSSaCS},
year = {2002},
pages = {205-222},
ee = {http://link.springer.de/link/service/series/0558/bibs/2303/23030205.htm},
crossref = {DBLP:conf/fossacs/2002},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/fossacs/2002,
editor = {Mogens Nielsen and
Uffe Engberg},
title = {Foundations of Software Science and Computation Structures,
5th International Conference, FOSSACS 2002. Held as Part
of the Joint European Conferences on Theory and Practice
of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002,
Proceedings},
booktitle = {FoSSaCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2303},
year = {2002},
isbn = {3-540-43366-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-03-18 by Michael Ley (ley@uni-trier.de)