Tree Automata with One Memory, Set Constraints and Cryptographic Protocols

Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Hubert Comon and Véronique Cortier. Theoretical Computer Science, 331(1):143–214, Elsevier Science Publishers, February 2005.

Download

[PDF] [PS] [HTML]

Abstract

(unavailable)

BibTeX

@article{comon03TCS,
  author =        {Comon, Hubert and Cortier, V{\'e}ronique},
  journal =       {Theoretical Computer Science},
  month =         feb,
  number =        {1},
  pages =         {143-214},
  publisher =     {Elsevier Science Publishers},
  title =         {Tree Automata with One Memory, Set Constraints and
                   Cryptographic Protocols},
  volume =        {331},
  year =          {2005},
  doi =           {10.1016/j.tcs.2004.09.036},
}