The Recognizability Problem for Tree Automata with Comparisons between Brothers

@inproceedings{Bogaert1999TheRP,
  title={The Recognizability Problem for Tree Automata with Comparisons between Brothers},
  author={Bruno Bogaert and Franck Seynhaeve and Sophie Tison},
  booktitle={FoSSaCS},
  year={1999}
}
Several extensions of tree automata have been deened, in order to take in account non-linearity in terms. Roughly, these automata allow equality or disequality constraints between subterms. They have been used to get decision results, e.g. in term rewriting. One natural question arises when we consider a language recognized by such an automaton: is this language recognizable, i.e. are the constraints necessary? Here we study this problem in the class REC6 = corresponding to comparisons between… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS