50 search results - page 3 / 10 » Querying Unranked Trees with Stepwise Tree Automata |
DBPL
2005
Springer
15 years 5 months ago
2005
Springer
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
FROCOS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
85
Voted
RTA
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
