2014
DOI: 10.1007/978-3-642-54830-7_1
View full text
|
|
Share

Abstract: Abstract. Language equivalence of deterministic pushdown automata (DPDA) was shown to be decidable by Sénizergues (1997Sénizergues ( , 2001Stirling (2002) then showed that the problem is primitive recursive.Sénizergues (1998, 2005) also generalized his proof to show decidability of bisimulation equivalence of (nondeterministic) PDA where ε-rules can be only deterministic and popping; this problem was shown to be nonelementary by Benedikt, Göller, Kiefer, and Murawski (2013), even for PDA with no ε-rules.Here…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

1
12
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals