Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
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

Mikolaj Bojanczyk, Thomas Place
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
ICALP, 2012.

ICALP v2 2012
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v2-2012-BojanczykP,
	author        = "Mikolaj Bojanczyk and Thomas Place",
	booktitle     = "{Proceedings of the 39th International Colloquium on Automata, Languages, and Programming, Part II}",
	doi           = "10.1007/978-3-642-31585-5_13",
	isbn          = "978-3-642-31584-8",
	pages         = "104--115",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets}",
	volume        = 7392,
	year          = 2012,
}

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.