Author： Vagvolgyi S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 449-459
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
Abstracting cryptographic protocols with tree automata
By Monniaux D.
Science of Computer Programming, Vol. 47, Iss. 2, 2003-05 ,pp. :
Access to resources
Recommend
Restricted ground tree transducers
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,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. :