74 search results - page 3 / 15 » The Emptiness Problem for Tree Automata with Global Constrai... |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
DLT
2004
13 years 6 months ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
IPL
2002
13 years 5 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
CADE
2006
Springer
13 years 9 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
RP
2009
Springer
13 years 11 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...