662 search results - page 69 / 133 » Trees, Automata and XML |
159
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
159
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
180
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
168
Voted
WCRE
2000
IEEE
15 years 10 months ago
2000
IEEE
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
179
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...