Walking on data words
From MaRDI portal
Publication:504989
DOI10.1007/S00224-014-9603-3zbMATH Open1353.68169OpenAlexW2032862624MaRDI QIDQ504989FDOQ504989
Authors: Amaldev Manuel, Anca Muscholl, 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
Recommendations
Cites Work
- Two-variable logic on data trees and XML reasoning
- Two-variable logic on data words
- Halting space-bounded computations
- Title not available (Why is that?)
- Two-variable logic on 2-dimensional structures
- Title not available (Why is that?)
- Finite-memory automata
- Temporal logics on words with multiple data values
- On notions of regularity for data languages
- Descriptional and computational complexity of finite automata -- a survey
- Title not available (Why is that?)
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking automata cannot be determinized
- Two-variable logic with two order relations (extended abstract)
- Finite state machines for strings over infinite alphabets
- Regular expressions for data words
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Walking on data words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504989)
