Sciweavers

1705 search results - page 4 / 341
» Representing Constraints with Automata
Sort
View
CADE
2006
Springer
14 years 8 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
FROCOS
2007
Springer
14 years 1 months ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
The HOM problem is decidable
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...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICAC
2005
IEEE
14 years 1 months ago
Multi-resolution Abnormal Trace Detection Using Varied-length N-grams and Automata
Detection and diagnosis of faults in a large-scale distributed system is a formidable task. Interest in monitoring and using traces of user requests for fault detection has been o...
Guofei Jiang, Haifeng Chen, Cristian Ungureanu, Ke...