54 search results - page 3 / 11 » Deterministic Automata on Unranked Trees |
RTA
2005
Springer
13 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...
MFCS
2009
Springer
14 years 10 days 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�...
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
WIA
2009
Springer
14 years 11 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...
FROCOS
2007
Springer
13 years 12 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:...