Decision problems for patterns
Journal of Computer and System Sciences
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Handbook of formal languages, vol. 1
Theory of Codes
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Efficient Solving of the Word Equations in One Variable
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
The Expressibility of Languages and Relations by Word Equations
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Quantifier Hierarchies over Word Relations
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Combinatorial and Computational Problems on Finite Sets of Words
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A constraint solver for sequences and its applications
Proceedings of the 2006 ACM symposium on Applied computing
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Bad news on decision problems for patterns
Information and Computation
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Constraint solving for sequences in software validation and verification
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars
ACM Transactions on Software Engineering and Methodology (TOSEM)
Word equations with length constraints: what's decidable?
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
Classically, several properties and relations of words, such as “being a power of the same word” can be expressed by using word equations. This paper is devoted to a general study of the expressive power of word equations. As main results we prove theorems which allow us to show that certain properties of words are not expressible as components of solutions of word equations. In particular, “the primitiveness” and “the equal length” are such properties, as well as being “any word over a proper subalphabet”.