113 search results - page 16 / 23 » Height-Deterministic Pushdown Automata |
106
click to vote
FOSSACS
2006
Springer
15 years 5 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
100
click to vote
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
124
Voted
ICTAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-determinis...
133
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
103
Voted
FOIKS
2008
Springer
15 years 3 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...