On pebble automata for data languages with decidable emptiness problem
type: Item
instance of: scholarly article
title: On pebble automata for data languages with decidable emptiness problem
zbMATH Open document ID: 1208.68142
author: Tony Tan
published in: Journal of Computer and System Sciences
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 5796731
zbMATH Keywords: finite state automata
zbMATH Keywords: infinite alphabet
zbMATH Keywords: decidability
zbMATH Keywords: 2-pebble automata
zbMATH Keywords: 3-pebble automata
MaRDI profile type: Publication
full work available at URL: j.jcss.2010.03.004
OpenAlex ID: W2042546332
cites work: CONCUR 2004 - Concurrency Theory
cites work: Inconsistency Tolerance
cites work: On Notions of Regularity for Data Languages
cites work: Two-variable logic on data words
cites work: Expressive Power of Pebble Automata
cites work: LTL with the freeze quantifier and register automata
cites work: On Reasoning About Rings
cites work: Q3862379
cites work: Finite-memory automata
cites work: A Note on Two-pebble Automata Over Infinite Alphabets
cites work: Undecidable problems in unreliable computations.
cites work: Q4411812
cites work: Finite state machines for strings over infinite alphabets
cites work: Verifying lossy channel systems has nonprimitive recursive complexity.
cites work: Automata and Logics for Words and Trees over an Infinite Alphabet
cites work: Graph Reachability and Pebble Automata over Infinite Alphabets
cites work: On Pebble Automata for Data Languages with Decidable Emptiness Problem
DOI: 10.1016/J.JCSS.2010.03.004
description: scientific article; zbMATH DE number 5796731