The following pages link to Timothy Ng (Q1622987):
Displayed 29 items.
- Outfix-guided insertion (Q1682857) (← links)
- Word blending in formal languages: the Brangelina effect (Q1799362) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- State complexity of simple splicing (Q2179338) (← links)
- State complexity of pseudocatenation (Q2278276) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- State complexity of suffix distance (Q2401012) (← links)
- Pseudoknot-generating operation (Q2405891) (← links)
- Relative prefix distance between languages (Q2408810) (← links)
- Pseudoknot-Generating Operation (Q2794363) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- (Q4609332) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Quasi-Distances and Weighted Finite Automata (Q4683187) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- Word Blending in Formal Languages* (Q5114213) (← links)
- State Complexity of Suffix Distance (Q5205049) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Closest substring problems for regular languages (Q5915558) (← links)
- Closest substring problems for regular languages (Q5918147) (← links)
- Conjugate word blending: formal model and experimental implementation by XPCR (Q6095510) (← links)
- Descriptional Complexity of Semi-Simple Splicing Systems (Q6169897) (← links)