On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968): Difference between revisions

@@ Property / arXiv ID @@
+.5844
@@ Property / arXiv ID: 0910.5844 / rank @@
+Normal rank
@@ Property / cites work @@
+On Notions of Regularity for Data Languages
@@ Property / cites work: On Notions of Regularity for Data Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Two-variable logic on data words
@@ Property / cites work: Two-variable logic on data words / rank @@
+Normal rank
@@ Property / cites work @@
+Expressive Power of Pebble Automata
@@ Property / cites work: Expressive Power of Pebble Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-memory automata
@@ Property / cites work: Finite-memory automata / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Two-pebble Automata Over Infinite Alphabets
+Normal rank
@@ Property / cites work @@
+Undecidable problems in unreliable computations.
@@ Property / cites work: Undecidable problems in unreliable computations. / rank @@
+Normal rank
@@ Property / cites work @@
+Finite state machines for strings over infinite alphabets
+Normal rank
@@ Property / cites work @@
+Verifying lossy channel systems has nonprimitive recursive complexity.
+Normal rank
@@ Property / cites work @@
+Automata and Logics for Words and Trees over an Infinite Alphabet
+Normal rank
@@ Property / cites work @@
+Graph Reachability and Pebble Automata over Infinite Alphabets
+Normal rank