On Notions of Regularity for Data Languages
From MaRDI portal
Publication:5444950
DOI10.1007/978-3-540-74240-1_9zbMath1135.68451MaRDI QIDQ5444950
Henrik Björklund, Thomas Schwentick
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_9
68Q45: Formal languages and automata
Related Items
Model checking memoryful linear-time logics over one-counter automata, On pebble automata for data languages with decidable emptiness problem, ML and Extended Branching VASS, On Pebble Automata for Data Languages with Decidable Emptiness Problem, Automata on Gauss Words, Algorithmic Analysis of Array-Accessing Programs, Counting Multiplicity over Infinite Alphabets