113 search results - page 11 / 23 » 2-Visibly Pushdown Automata |
FASE
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper, we present an automata-theoretic approach to Hardware/Software (HW/SW) co-verification. We designed a co-specification framework describing HW/SW systems; ...
ICTAC
2007
Springer
14 years 1 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...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...