Personal tools
You are here: Home Events Lab lunch speakers 2010 Tony Tan

Tony Tan

Infinite alphabets, directed graphs and pebble automata We will see how words over infinite alphabets can be viewed as directed graphs and show how we can use pebble automata, a model of computation for infinite alphabets, as automata for directed graphs

Document Actions