Pages that link to "Item:Q5470731"
From MaRDI portal
The following pages link to Word Problems and Membership Problems on Compressed Words (Q5470731):
Displaying 27 items.
- Leaf languages and string compression (Q550251) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- The compressed word problem in relatively hyperbolic groups (Q2153344) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
- THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products (Q3392958) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS (Q4904513) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
- (Q5090487) (← links)
- (Q5092405) (← links)
- SLP compression for solutions of equations with constraints in free and hyperbolic groups (Q5246505) (← links)
- Algorithms for contractibility of compressed curves on 3-manifold boundaries (Q6174804) (← links)
