Walking on data words
type: Item
instance of: scholarly article
title: Walking on data words
zbMATH Open document ID: 1353.68169
author: Amaldev Manuel
author: Anca Muscholl
author: Gabriele Puppis
published in: Theory of Computing Systems
publication date: 2017-01-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6676004
zbMATH Keywords: data languages
zbMATH Keywords: walking automata
MaRDI profile type: Publication
full work available at URL: s00224-014-9603-3
OpenAlex ID: W2032862624
cites work: On notions of regularity for data languages
cites work: Tree-walking automata cannot be determinized
cites work: Tree-Walking Automata Do Not Recognize All Regular Languages
cites work: Two-variable logic on data words
cites work: Two-variable logic on data trees and XML reasoning
cites work: Finite-memory automata
cites work: Descriptional and computational complexity of finite automata -- a survey
cites work: Temporal logics on words with multiple data values
cites work: Regular Expressions for Data Words
cites work: Two-Variable Logic on 2-Dimensional Structures.
cites work: Q5641083
cites work: Finite state machines for strings over infinite alphabets
cites work: Q5541339
cites work: Two-Variable Logic with Two Order Relations
cites work: Halting space-bounded computations
cites work: Q4353626
cites work: Q4393484
DOI: 10.1007/S00224-014-9603-3
description: scientific article; zbMATH DE number 6676004