Higher-Order Pushdown Trees Are Easy
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
Higher-Order Pushdown Trees Are Easy
FoSSaCS, 2002.

FoSSaCS 2002
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{FoSSaCS-2002-KnapikNU,
	author        = "Teodor Knapik and Damian Niwinski and Pawel Urzyczyn",
	booktitle     = "{Proceedings of the Fifth International Conference on Foundations of Software Science and Computation Structures}",
	doi           = "10.1007/3-540-45931-6_15",
	isbn          = "3-540-43366-X",
	pages         = "205--222",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Higher-Order Pushdown Trees Are Easy}",
	volume        = 2303,
	year          = 2002,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.