113 search results - page 13 / 23 » 2-Visibly Pushdown Automata |
CAV
2006
Springer
15 years 5 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
DLT
2008
15 years 3 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
121
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
107
Voted
FOSSACS
2005
Springer
15 years 7 months ago
2005
Springer
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
107
click to vote
CONCUR
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...