Games for active XML revisited
From MaRDI portal
Publication:2402614
DOI10.1007/s00224-016-9682-4zbMath1370.68073arXiv1412.5910OpenAlexW2963721710MaRDI QIDQ2402614
Martin Schuster, Thomas Schwentick
Publication date: 20 September 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5910
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Applications of game theory (91A80) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Complete problems for deterministic polynomial time
- Game logic -- an overview
- Logic games are complete for game logics
- Domino-tiling games
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- Active context-free games
- Synthesis for Structure Rewriting Systems
- Adding nesting structure to words
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
- Alternation
- Deterministic regular languages
- Games for Active XML Revisited.