|
ComputingReviews.com
|
Graph reachability and pebble automata over infinite alphabets Tan T. ACM Transactions on Computational Logic14(3):1-31,2013.Type:Article |
|
|
|
Published By: ACM Press |
|
|
|
|
|
|
|
|
Use your personal or institutional subscription to read the fulltext of the article.
|
|
|
|
|
|
|
|
|
|
|
|