The “Almost All” Theory of Subrecursive Degrees is Decidable
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

Kurt Mehlhorn
The “Almost AllTheory of Subrecursive Degrees is Decidable
ICALP, 1974.

ICALP 1974
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1974-Mehlhorn,
	author        = "Kurt Mehlhorn",
	booktitle     = "{Proceedings of the Second Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-06841-4_70",
	isbn          = "3-540-06841-4",
	pages         = "317--325",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{The “Almost All” Theory of Subrecursive Degrees is Decidable}",
	volume        = 14,
	year          = 1974,
}

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.