662 search results - page 16 / 133 » Trees, Automata and XML |
194
click to vote
ACL
1997
15 years 7 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
149
click to vote
CADE
2006
Springer
15 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...
190
click to vote
IS
2008
15 years 6 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
162
click to vote
IPL
2002
15 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...
187
click to vote
RP
2009
Springer
16 years 16 days 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...