Abstracting cryptographic protocols with tree automata

By Monniaux D.  

Science of Computer Programming, Vol. 47, Iss. 2, 2003-05 ,pp. : 177-202

Elsevier

Access to resources Recommend Favorite

On ground tree transformations and congruences induced by tree automata

By Vagvolgyi S.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 449-459

Elsevier

Access to resources Recommend Favorite

Compiling CSPs into Tree-Driven Automata for Interactive Solving

By Fargier Hélène   Vilarem Marie-Catherine  

Constraints, Vol. 9, Iss. 4, 2004-10 ,pp. : 263-287

Springer Publishing Company

Access to resources Recommend Favorite

Decidability of equivalence for deterministic synchronized tree automata

By Salomaa K.  

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 171-192

Elsevier

Access to resources Recommend Favorite

Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra

By Muller D.E.   Schupp P.E.  

Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. : 69-107

Elsevier

Access to resources Recommend Favorite