110 search results - page 11 / 22 » Restrictions on Tree Adjoining Languages |
158
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
234
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
153
click to vote
IANDC
2011
14 years 11 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
118
click to vote
CAISE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are ex...
144
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Abstract. We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which ca...