The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable
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

Yves Andre, Francis Bossut
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable
TAPSOFT, 1995.

TAPSOFT 1995
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{TAPSOFT-1995-AndreB,
	author        = "Yves Andre and Francis Bossut",
	booktitle     = "{Proceedings of the Sixth International Joint Conference on Theory and Practice of Software Development}",
	doi           = "10.1007/3-540-59293-8_193",
	isbn          = "3-540-59293-8",
	pages         = "155--171",
	publisher     = "{Springer}",
	title         = "{The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable}",
	year          = 1995,
}

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.