54 search results - page 3 / 11 » Deterministic Automata on Unranked Trees |
151
click to vote
RTA
2005
Springer
15 years 11 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...
156
click to vote
MFCS
2009
Springer
16 years 4 hour ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
132
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
165
click to vote
WIA
2009
Springer
16 years 1 days ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
145
click to vote
FROCOS
2007
Springer
15 years 11 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:...