COMPUTER SCIENCE
TATA REPORT
1 RECOGNIZABLE TREE LANGUAGES AND FINITE TREE AUTOMATA 2 REGULAR GRAMMARS AND REGULAR EXPRESSIONS 3 LOGIC, AUTOMATA AND RELATIONS 4 AUTOMATA WITH CONSTRAINTS 5 TREE SET AUTOMATA 6 TREE TRANSDUCERS 7 ALTERNATING TREE AUTOMATA BIBLIOGRAPHY