Rewriting Techniques and Applications

DOI10.1007/B98160zbMath1187.68188OpenAlexW2661706449MaRDI QIDQ5901564

Joachim Niehren, Julien Carme, Marc Tommasi

Publication date: 30 April 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98160

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Data structures (68P05)

Related Items (19)

Deciding twig-definability of node selecting tree automata ⋮ Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-Viral Infection Patterns ⋮ Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Simplifying the signature in second-order unification ⋮ Query Automata for Nested Words ⋮ Automata for XML -- a survey ⋮ On the minimization of XML schemas and tree automata for unranked trees ⋮ Logics and Automata for Totally Ordered Trees ⋮ Schema-Guided Induction of Monadic Queries ⋮ Unnamed Item ⋮ Variable Tree Automata over Infinite Ranked Alphabets ⋮ Automata for unordered trees ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Streaming tree automata ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ State Trade-Offs in Unranked Tree Automata ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Automata on finite trees ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas

This page was built for publication: Rewriting Techniques and Applications