23 search results - page 3 / 5 » Branching Pushdown Tree Automata |
LICS
2008
IEEE
14 years 20 days ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
CIKM
2008
Springer
13 years 8 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...
IANDC
2007
13 years 6 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
SIGCSE
1997
ACM
13 years 10 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...