Pages that link to "Item:Q5901564"
From MaRDI portal
The following pages link to Rewriting Techniques and Applications (Q5901564):
Displaying 18 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Automata for unordered trees (Q515668) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Simplifying the signature in second-order unification (Q843951) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Streaming tree automata (Q975511) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Automata on finite trees (Q2074209) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- Logics and Automata for Totally Ordered Trees (Q3522020) (← links)
- Schema-Guided Induction of Monadic Queries (Q3530183) (← links)
- Bounded Delay and Concurrency for Earliest Query Answering (Q3618594) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-Viral Infection Patterns (Q5283820) (← links)
