Sciweavers

213 search results - page 15 / 43
» Relating Word and Tree Automata
Sort
View
JAPLL
2010
124views more  JAPLL 2010»
13 years 6 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
RTA
2007
Springer
14 years 1 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
IANDC
2011
91views more  IANDC 2011»
13 years 2 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
NAACL
2001
13 years 9 months ago
Tree-Cut and a Lexicon Based on Systematic Polysemy
This paper describes a lexicon organized around systematic polysemy: a set of word senses that are related in systematic and predictable ways. The lexicon is derived by a fully au...
Noriko Tomuro