104 search results - page 6 / 21 » Tree Automata with Global Constraints |
186
Voted
LICS
2002
IEEE
16 years 10 days ago
2002
IEEE
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...
244
click to vote
ATVA
2004
Springer
16 years 25 days ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
191
Voted
ESOP
2003
Springer
16 years 19 days ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
190
Voted
CADE
2001
Springer
15 years 12 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
239
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...