662 search results - page 22 / 133 » Trees, Automata and XML |
146
click to vote
CAV
2006
Springer
15 years 9 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
174
click to vote
WIA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
149
click to vote
DLT
2004
15 years 7 months ago
2004
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
148
click to vote
STACS
2007
Springer
16 years 4 days ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
186
click to vote
ADC
2008
Springer
16 years 11 days ago
2008
Springer
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...