371 search results - page 14 / 75 » Pushdown Automata Simulator |
127
click to vote
LICS
2006
IEEE
15 years 7 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
129
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
106
click to vote
ENTCS
2006
15 years 1 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
JUCS
2002
15 years 1 months ago
2002
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
103
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...