On pebble automata for data languages with decidable emptiness problem (Q1959427): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2010.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2042546332
@@ Property / OpenAlex ID: W2042546332 / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2004 - Concurrency Theory
@@ Property / cites work: CONCUR 2004 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Inconsistency Tolerance
@@ Property / cites work: Inconsistency Tolerance / 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 @@
+LTL with the freeze quantifier and register automata
+Normal rank
@@ Property / cites work @@
+On Reasoning About Rings
@@ Property / cites work: On Reasoning About Rings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / 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 @@
+Q4411812
@@ Property / cites work: Q4411812 / 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
@@ Property / cites work @@
+On Pebble Automata for Data Languages with Decidable Emptiness Problem
+Normal rank