662 search results - page 42 / 133 » Trees, Automata and XML |
181
click to vote
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
141
click to vote
EACL
2003
ACL Anthology
15 years 7 months ago
2003
ACL Anthology
CLaRK is an XML-based software system for corpora development. It incorporates several technologies: XML technology; Unicode; Regular Cascaded Grammars; Constraints over XML Docum...
151
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
172
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
162
click to vote
CADE
2001
Springer
15 years 10 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...