Unification with Singleton Tree Grammars

DOI10.1007/978-3-642-02348-4_26zbMath1242.68132OpenAlexW1519768517MaRDI QIDQ3636835

Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauss

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Related Items (2)

Parameter reduction and automata evaluation for grammar-compressed trees ⋮ On the complexity of the smallest grammar problem over fixed alphabets

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of tree automata and XPath on grammar-compressed trees
• Context unification with one context variable
• Processing Compressed Texts: A Tractability Border
• Bounded Second-Order Unification Is NP-Complete
• Stratified Context Unification Is NP-Complete
• Parameter Reduction in Grammar-Compressed Trees
• An Efficient Unification Algorithm
• Word Problems and Membership Problems on Compressed Words
• Database Programming Languages
• A Machine-Oriented Logic Based on the Resolution Principle
• Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
• Rewriting Techniques and Applications

This page was built for publication: Unification with Singleton Tree Grammars