Complexity of Matching Problems
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

Dan Benanav, Deepak Kapur, Paliath Narendran
Complexity of Matching Problems
RTA, 1985.

RTA 1985
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{RTA-1985-BenanavKN,
	author        = "Dan Benanav and Deepak Kapur and Paliath Narendran",
	booktitle     = "{Proceedings of the First International Conference on Rewriting Techniques and Applications}",
	doi           = "10.1007/3-540-15976-2_22",
	editor        = "Jean-Pierre Jouannaud",
	isbn          = "3-540-15976-2",
	pages         = "417--429",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Complexity of Matching Problems}",
	volume        = 202,
	year          = 1985,
}

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.