Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
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

Dietrich Kuske
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT, 2001.

DLT 2001
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{DLT-2001-Kuske,
	author        = "Dietrich Kuske",
	booktitle     = "{Revised Papers of the Fifth International Conference on Developments in Language Theory}",
	doi           = "10.1007/3-540-46011-X_17",
	isbn          = "3-540-43453-4",
	pages         = "206--216",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable}",
	volume        = 2295,
	year          = 2001,
}

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.