Regular expressions for data words
From MaRDI portal
Publication:2353403
DOI10.1016/J.JCSS.2015.03.005zbMATH Open1320.68113OpenAlexW2002208751MaRDI QIDQ2353403FDOQ2353403
Authors: Tony Tan, Domajoj Vrgoč, Leonid Libkin 
Publication date: 13 July 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.03.005
Recommendations
Cites Work
- LTL with the freeze quantifier and register automata
- Automata and Logics for Words and Trees over an Infinite Alphabet
- XPath evaluation in linear time
- Automata for XML -- a survey
- Two-variable logic on data words
- Title not available (Why is that?)
- Finding Regular Simple Paths in Graph Databases
- Finite-memory automata
- Variable automata over infinite alphabets
- Automata vs. Logics on Data Words
- A lower bound technique for the size of nondeterministic finite automata
- Rewriting of regular expressions and regular path queries
- Tree Automata over Infinite Alphabets
- Finite state machines for strings over infinite alphabets
- Logics for Unranked Trees: An Overview
- Intractability of decision problems for finite-memory automata
- Regular expressions with binding over data words for querying graph databases
- Regular expressions for data words
- On the use of guards for logics with data
Cited In (16)
- Title not available (Why is that?)
- Synthesis of data word transducers
- Reactive synthesis from visibly register pushdown automata
- Regular expressions for data words
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Active learning for deterministic bottom-up nominal tree automata
- Problems on finite automata and the exponential time hypothesis
- Title not available (Why is that?)
- Regular expressions for querying data graphs
- Optimal run problem for weighted register automata
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- Complexity results on register context-free grammars and related formalisms
- Automata and grammars for data words
- Regular Transformations of Data Words Through Origin Information
- On computability of data word functions defined by transducers
- Nominal automata with name binding
This page was built for publication: Regular expressions for data words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353403)
