Graph Reachability and Pebble Automata over Infinite Alphabets
From MaRDI portal
Publication:2946705
DOI10.1145/2499937.2499940zbMath1353.68172arXiv1110.2776OpenAlexW2164433662MaRDI QIDQ2946705
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.2776
Applications of graph theory (05C90) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (5)
On Pebble Automata for Data Languages with Decidable Emptiness Problem ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ On pebble automata for data languages with decidable emptiness problem ⋮ Subsequence versus substring constraints in sequence pattern languages ⋮ Two-way pebble transducers for partial functions and their composition
This page was built for publication: Graph Reachability and Pebble Automata over Infinite Alphabets
