Pages that link to "Item:Q4365010"
From MaRDI portal
The following pages link to Finite degrees of ambiguity in pattern languages (Q4365010):
Displaying 14 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- Groups whose word problems are not semilinear (Q2317163) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- (Q4893892) (← links)
- (Q4955303) (← links)
- (Q5136316) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)