On the Solvability Problem for Restricted Classes of Word Equations

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on Developments in Language Theory

• Publication date

  2016-07-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-53132-7_25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Pattern Matching with Variables: Fast Algorithms and New Hardness Results

  2015cited by this paper
• On the Parameterised Complexity of String Morphism Problems

  2015cited by this paper
• One-Variable Word Equations in Linear Time

  2013influential reference
• Pattern matching with variables: A multivariate complexity analysis

  2013cited by this paper
• Patterns with bounded treewidth

  2012cited by this paper
• Recompression

  2012cited by this paper
• An efficient algorithm for solving word equations

  2006cited by this paper
• Solving Two-Variable Word Equations (Extended Abstract)

  2004cited by this paper
• Algebraic Combinatorics on Words: Index of Notation

  2002cited by this paper
• Quadratic Word Equations

  1999cited by this paper
• Which problems have strongly exponential complexity?

  1998cited by this paper
• On the Computational Complexity of Codes in Graphs

  1988cited by this paper
• The complexity of satisfiability problems

  1978cited by this paper
• The Problem of Solvability of Equations in a Free Semigroup

  1977cited by this paper

• Languages Generated by Conjunctive Query Fragments of FC[REG]

  2024cites this paper
• Matching Patterns with Variables

  2019cites this paper
• Ju l 2 01 9 Matching Patterns with Variables

  2019cites this paper
• Loughborough University Institutional Repository The hardness of solving simple word equations

  2019cites this paper
• The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability

  2018cites this paper
• On Matching Generalised Repetitive Patterns

  2018cites this paper
• The Satisfiability of Word Equations: Decidable and Undecidable Theories

  2018cites this paper
• The Hardness of Solving Simple Word Equations

  2017influential citation