Sciweavers

1000 search results - page 77 / 200
» Dependency Tree Automata
Sort
View
LATA
2009
Springer
15 years 6 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
CSL
2010
Springer
15 years 1 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
DKE
2007
136views more  DKE 2007»
14 years 12 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
PLDI
1995
ACM
15 years 3 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
ICDT
2007
ACM
185views Database» more  ICDT 2007»
15 years 6 months ago
Characterization of the Interaction of XML Functional Dependencies with DTDs
With the rise of XML as a standard model of data exchange, XML functional dependencies (XFDs) have become important to areas such as key analysis, document normalization, and data ...
Lucja Kot, Walker M. White