The equivalence problem for t-turn dpda is co-NP

Authors:
Géraud Sénizergues
Affiliations:
LaBRI and Université de Bordeaux I
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 8
Cited 6

L(A) = L(B)? decidability results from complete formal systems

Theoretical Computer Science
Decidability of DPDA equivalence

Theoretical Computer Science
L(A)=L(B)? a simplified decidability proof

Theoretical Computer Science
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Deciding DPDA Equivalence Is Primitive Recursive

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Higher-Order Pushdown Trees Are Easy

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

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

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Second-order simple grammars

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Decidability of DPDA Language Equivalence via First-Order Grammars

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Equivalence of deterministic one-counter automata is NL-complete

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
LALBLC a program testing the equivalence of dpda's

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Bisimulation equivalence and regularity for real-time one-counter automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing that, for every fixed integer t ≥ 1, the equivalence problem for t-turn deterministic pushdown automata is co-NP. This complexity result refines those of [Val74, Bee76].