Walking on data words

DOI10.1007/s00224-014-9603-3zbMath1353.68169OpenAlexW2032862624MaRDI QIDQ504989

Anca Muscholl, Amaldev Manuel, Gabriele Puppis

Publication date: 18 January 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9603-3

zbMATH Keywords

data languageswalking automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Nominal Automata with Name Binding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptional and computational complexity of finite automata -- a survey
• Tree-walking automata cannot be determinized
• On notions of regularity for data languages
• Halting space-bounded computations
• Finite-memory automata
• Regular Expressions for Data Words
• Temporal Logics on Words with Multiple Data Values.
• Two-variable logic on data words
• Two-Variable Logic on 2-Dimensional Structures.
• Two-variable logic on data trees and XML reasoning
• Tree-Walking Automata Do Not Recognize All Regular Languages
• Finite state machines for strings over infinite alphabets
• Two-Variable Logic with Two Order Relations

This page was built for publication: Walking on data words