Pages that link to "Item:Q599499"

The following pages link to Finding a homomorphism between two words is NP-complete (Q599499):

Displaying 25 items.

• A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
• On the parameterised complexity of string morphism problems (Q315525) (← links)
• Inferring descriptive generalisations of formal languages (Q355503) (← links)
• Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
• Discontinuities in pattern inference (Q924176) (← links)
• The unambiguity of segmented morphisms (Q967360) (← links)
• Existence and nonexistence of descriptive patterns (Q986561) (← links)
• Detecting patterns in finite regular and context-free languages (Q990125) (← links)
• Morphically primitive words (Q1019730) (← links)
• Polynomial-time algorithm for fixed points of nontrivial morphisms (Q1044983) (← links)
• Hide and seek with repetitions (Q1713479) (← links)
• Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
• Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
• A note on the complexity of matching patterns with variables (Q2445237) (← links)
• A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
• Unambiguous erasing morphisms in free monoids (Q3566348) (← links)
• Unambiguous Erasing Morphisms in Free Monoids (Q3599095) (← links)
• Existence and Nonexistence of Descriptive Patterns (Q3637228) (← links)
• (Q5092406) (← links)
• The hardness of solving simple word equations (Q5111232) (← links)
• Detecting One-Variable Patterns (Q5150937) (← links)
• Complexity of testing morphic primitivity (Q5298777) (← links)
• On the structure of solution-sets to regular word equations (Q6614609) (← links)
• Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)
• The equivalence problem of E-pattern languages with regular constraints is undecidable (Q6666804) (← links)