Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
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

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
DLT, 2012.

DLT 2012
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{DLT-2012-CaralpRT,
	author        = "Mathieu Caralp and Pierre-Alain Reynier and Jean-Marc Talbot",
	booktitle     = "{Proceedings of the 16th International Conference on Developments in Language Theory}",
	doi           = "10.1007/978-3-642-31653-1_21",
	isbn          = "978-3-642-31652-4",
	pages         = "226--238",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness}",
	volume        = 7410,
	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.