Author： Fargier Hélène Vilarem Marie-Catherine
Publisher： Springer Publishing Company
ISSN： 1383-7133
Source： Constraints, Vol.9, Iss.4, 2004-10, pp. : 263-287
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Abstracting cryptographic protocols with tree automata
By Monniaux D.
Science of Computer Programming, Vol. 47, Iss. 2, 2003-05 ,pp. :
On ground tree transformations and congruences induced by tree automata
By Vagvolgyi S.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Decidability of equivalence for deterministic synchronized tree automata
By Salomaa K.
Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. :
Stochastically costed tree automata: Turakainen's theorem
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :