Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the equa...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 17, Issue 4
Main Authors:	Lin, Anthony W., Majumdar, Rupak
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2021
Subjects:	computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!