104 search results - page 6 / 21 » Tree Automata with Global Constraints |
LICS
2002
IEEE
14 years 14 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...
ATVA
2004
Springer
14 years 29 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, ...
ESOP
2003
Springer
14 years 23 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...
CADE
2001
Springer
14 years 2 days 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...
STOC
2010
ACM
14 years 5 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...