Recommendations
Cites work
- scientific article; zbMATH DE number 1059319 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Descriptional and computational complexity of finite automata -- a survey
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Halting space-bounded computations
- On notions of regularity for data languages
- Regular expressions for data words
- Temporal logics on words with multiple data values
- Tree-Walking Automata Do Not Recognize All Regular Languages
- Tree-walking automata cannot be determinized
- Two-variable logic on 2-dimensional structures
- Two-variable logic on data trees and XML reasoning
- Two-variable logic on data words
- Two-variable logic with two order relations (extended abstract)
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)