Equivalence of deterministic one-counter automata is NL-complete
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

Stanislav Böhm, Stefan Göller, Petr Jancar
Equivalence of deterministic one-counter automata is NL-complete
STOC, 2013.

STOC 2013
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2013-BohmGJ,
	author        = "Stanislav Böhm and Stefan Göller and Petr Jancar",
	booktitle     = "{Proceedings of the 45th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/2488608.2488626",
	isbn          = "978-1-4503-2029-0",
	pages         = "131--140",
	publisher     = "{ACM}",
	title         = "{Equivalence of deterministic one-counter automata is NL-complete}",
	year          = 2013,
}

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.