Unification with Singleton Tree Grammars
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- An Efficient Unification Algorithm
- Bounded Second-Order Unification Is NP-Complete
- Context unification with one context variable
- Database Programming Languages
- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
- scientific article; zbMATH DE number 2086239 (Why is no real title available?)
- Parameter Reduction in Grammar-Compressed Trees
- Processing Compressed Texts: A Tractability Border
- Rewriting Techniques and Applications
- Stratified Context Unification Is NP-Complete
- The complexity of tree automata and XPath on grammar-compressed trees
- Unification theory
- Word Problems and Membership Problems on Compressed Words
Cited in
(8)- On the complexity of the smallest grammar problem over fixed alphabets
- Unification grammars.
- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
- scientific article; zbMATH DE number 176239 (Why is no real title available?)
- Parameter reduction and automata evaluation for grammar-compressed trees
- “Syntactic” AC-unification
- One-context unification with STG-compressed terms is in NP
- First-order unification on compressed terms
This page was built for publication: Unification with Singleton Tree Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636835)