Approximate Pattern Matching is Expressible in Transitive Closure Logic
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

Kjell Lemström, Lauri Hella
Approximate Pattern Matching is Expressible in Transitive Closure Logic
LICS, 2000.

LICS 2000
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LICS-2000-LemstromH,
	author        = "Kjell Lemström and Lauri Hella",
	booktitle     = "{Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science}",
	doi           = "10.1109/LICS.2000.855764",
	isbn          = "0-7695-0725-5",
	pages         = "157--167",
	publisher     = "{IEEE Computer Society}",
	title         = "{Approximate Pattern Matching is Expressible in Transitive Closure Logic}",
	year          = 2000,
}

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.