Skip to main content
Conference Proceedings

Language equivalence of deterministic real-time one-counter automata is NL-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6907 LNCS 194-205
DOI: 10.1007/978-3-642-22993-0_20
11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that deciding language equivalence of deterministic real-time one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well. © 2011 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Böhm, S., & Göller, S. (2011). Language equivalence of deterministic real-time one-counter automata is NL-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 194–205). https://doi.org/10.1007/978-3-642-22993-0_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free