Sciweavers

1423 search results - page 37 / 285
» Languages of Nested Trees
Sort
View
ICALP
1998
Springer
15 years 4 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
CASC
2010
Springer
155views Mathematics» more  CASC 2010»
14 years 10 months ago
Type Specialization in Aldor
Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametri...
Laurentiu Dragan, Stephen M. Watt
LATA
2009
Springer
15 years 6 months ago
Rigid Tree Automata
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 rest...
Florent Jacquemard, Francis Klay, Camille Vacher
LICS
2002
IEEE
15 years 4 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
EACL
2009
ACL Anthology
16 years 12 days ago
Dependency Trees and the Strong Generative Capacity of CCG
Alexander Koller, Marco Kuhlmann