1423 search results - page 50 / 285 » Languages of Nested Trees |
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
100
click to vote
JCSS
2007
14 years 11 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
102
click to vote
ACL
2012
13 years 2 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
ICALP
1997
Springer
15 years 3 months ago
1997
Springer