The following pages link to Thomas G. Szymanski (Q1229099):
Displayed 24 items.
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Concerning bounded-right-context grammars (Q1237575) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- Hash table reorganization (Q3696533) (← links)
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (Q3912082) (← links)
- Chaining Span-Dependent Jump Instructions (Q3922153) (← links)
- The Complexity of Finding Cycles in Periodic Functions (Q3936192) (← links)
- Data compression via textual substitution (Q3951542) (← links)
- On the complexity of LR(k) testing (Q4080747) (← links)
- Operations on sparse relations (Q4120132) (← links)
- Evaluating Relational Expressions with Dense and Sparse Arguments (Q4122802) (← links)
- A fast algorithm for computing longest common subsequences (Q4125781) (← links)
- (Q4133129) (← links)
- Succinctness of Descriptions of Unambiguous Context-Free Languages (Q4133160) (← links)
- (Q4134979) (← links)
- (Q4140366) (← links)
- Lower Bounds and Reductions Between Grammar Problems (Q4140408) (← links)
- Assembling code for machines with span-dependent instructions (Q4147585) (← links)
- Noncanonical Extensions of Bottom-Up Parsing Techniques (Q4151162) (← links)
- Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems'' (Q4170257) (← links)
- Program Schemes with Pushdown Stores (Q4404459) (← links)
- The macro model for data compression (Extended Abstract) (Q5402538) (← links)