Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael Kaminski, Tony Tan. A Note on Two-pebble Automata Over Infinite Alphabets. Fundamenta Informaticae, 98(4):379-390, 2010. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Graph Reachability and Pebble Automata over Infinite AlphabetsTony Tan. lics 2009: 157-166 [doi] Graph Reachability and Pebble Automata over Infinite AlphabetsTony Tan. tocl, 14(3):19, 2013. [doi] Tree Automata over Infinite AlphabetsMichael Kaminski, Tony Tan. birthday 2008: 386-423 [doi]
The following publications are possibly variants of this publication: