234 search results - page 25 / 47 » On Quasi-Products of Tree Automata |
161
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
182
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
114
click to vote
FUIN
2002
15 years 6 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
180
click to vote
LICS
2008
IEEE
16 years 17 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...
171
click to vote
WOLLIC
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...