Tree Automata with One Memory, Set Constraints and Ping-Pong Protocols

Tree Automata with One Memory, Set Constraints and Ping-Pong Protocols. Hubert Comon, Véronique Cortier, and John Mitchell. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), pp. 682–693, Lecture Notes in Computer Science 2076, Springer, Heraklion, Crete, Grece, July 2001.

Download

[PDF] [PS]

Abstract

(unavailable)

BibTeX

@inproceedings{comon01,
  address =       {Heraklion, Crete, Grece},
  author =        {Comon, Hubert and Cortier, V{\'e}ronique and
                   Mitchell, John},
  booktitle =     {{P}roceedings of the 28th {I}nternational
                   {C}olloquium on {A}utomata, {L}anguages and
                   {P}rogramming ({ICALP}'01)},
  editor =        {Orejas, Fernando and Spirakis, Paul G. and
                   van Leeuwen, Jan},
  month =         jul,
  pages =         {682-693},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {Tree Automata with One Memory, Set Constraints and
                   Ping-Pong Protocols},
  volume =        {2076},
  year =          {2001},
}