Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Fourth Annual IEEE Symposium on

Logic in Computer Science (LICS 2009)

Paper: Graph Reachability and Pebble Automata over Infinite Alphabets (at LICS 2009)

Authors: Tony Tan

Abstract

No Abstract Available

BibTeX

  @InProceedings{Tan-GraphReachabilityan,
    author = 	 {Tony Tan},
    title = 	 {Graph Reachability and Pebble Automata over Infinite Alphabets},
    booktitle =  {Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2009)},
    year =	 {2009},
    month =	 {August}, 
    pages =      {157--166},
    location =   {Los Angeles, California, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2022-10-3113:49
Sam Staton