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

Saved in:
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!
Abstract 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 equation. While the problem of solving word equations is decidable, the decidability of the problem of solving a word equation with a length constraint (i.e., a constraint relating the lengths of words in the word equation) has remained a long-standing open problem. We focus on the subclass of quadratic word equations, i.e., in which each variable occurs at most twice. We first show that the length abstractions of solutions to quadratic word equations are in general not Presburger-definable. We then describe a class of counter systems with Presburger transition relations which capture the length abstraction of a quadratic word equation with regular constraints. We provide an encoding of the effect of a simple loop of the counter systems in the existential theory of Presburger Arithmetic with divisibility (PAD). Since PAD is decidable (NP-hard and is in NEXP), we obtain a decision procedure for quadratic words equations with length constraints for which the associated counter system is flat (i.e., all nodes belong to at most one cycle). In particular, we show a decidability result (in fact, also an NP algorithm with a PAD oracle) for a recently proposed NP-complete fragment of word equations called regular-oriented word equations, when augmented with length constraints. We extend this decidability result (in fact, with a complexity upper bound of PSPACE with a PAD oracle) in the presence of regular constraints.
AbstractList 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 equation. While the problem of solving word equations is decidable, the decidability of the problem of solving a word equation with a length constraint (i.e., a constraint relating the lengths of words in the word equation) has remained a long-standing open problem. We focus on the subclass of quadratic word equations, i.e., in which each variable occurs at most twice. We first show that the length abstractions of solutions to quadratic word equations are in general not Presburger-definable. We then describe a class of counter systems with Presburger transition relations which capture the length abstraction of a quadratic word equation with regular constraints. We provide an encoding of the effect of a simple loop of the counter systems in the existential theory of Presburger Arithmetic with divisibility (PAD). Since PAD is decidable (NP-hard and is in NEXP), we obtain a decision procedure for quadratic words equations with length constraints for which the associated counter system is flat (i.e., all nodes belong to at most one cycle). In particular, we show a decidability result (in fact, also an NP algorithm with a PAD oracle) for a recently proposed NP-complete fragment of word equations called regular-oriented word equations, when augmented with length constraints. We extend this decidability result (in fact, with a complexity upper bound of PSPACE with a PAD oracle) in the presence of regular constraints.
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 equation. While the problem of solving word equations is decidable, the decidability of the problem of solving a word equation with a length constraint (i.e., a constraint relating the lengths of words in the word equation) has remained a long-standing open problem. We focus on the subclass of quadratic word equations, i.e., in which each variable occurs at most twice. We first show that the length abstractions of solutions to quadratic word equations are in general not Presburger-definable. We then describe a class of counter systems with Presburger transition relations which capture the length abstraction of a quadratic word equation with regular constraints. We provide an encoding of the effect of a simple loop of the counter systems in the existential theory of Presburger Arithmetic with divisibility (PAD). Since PAD is decidable (NP-hard and is in NEXP), we obtain a decision procedure for quadratic words equations with length constraints for which the associated counter system is flat (i.e., all nodes belong to at most one cycle). In particular, we show a decidability result (in fact, also an NP algorithm with a PAD oracle) for a recently proposed NP-complete fragment of word equations called regular-oriented word equations, when augmented with length constraints. We extend this decidability result (in fact, with a complexity upper bound of PSPACE with a PAD oracle) in the presence of regular constraints.
Author Majumdar, Rupak
Lin, Anthony W.
Author_xml – sequence: 1
  givenname: Anthony W.
  surname: Lin
  fullname: Lin, Anthony W.
– sequence: 2
  givenname: Rupak
  surname: Majumdar
  fullname: Majumdar, Rupak
BookMark eNpNkE9LAzEQxYNUsNZ-AG97VHA12c1uNt5KrVooqKh4DLP5U1O2u5pklX5701bEmcPMezA_hneMBm3XaoROCb6kZcarq2YtfUrYGb2m5xnOyAEakqrEacEZHfzbj9DY-xWOleekysohap96UA6Clclb51Qy--yj6FqffNvwnix0u4xjGo3gwLbBX0TRt0G75Hnjg15HA1qVPDrt694toz9x8XKtt8gd48Z-WW9r29iwOUGHBhqvx79zhF5vZy_T-3TxcDefThapzHEZUpkVmmKJdc2A8oIVWlGcF1lpmFaKGSnLLOdKASZGEm6qwqhMVZxipiknKh-h-Z6rOliJD2fX4DaiAyt2RueWAlz8sNECSiZrDkTVWNICWA014dLkQGWBOaWRRfYs6TrvnTZ_PILFLn-xzV8QJmjsbf75D5g_fhE
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-17(4:4)2021
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_a67cb9a1db0c45a7bab19cf3a4c50944
10_46298_lmcs_17_4_4_2021
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c306t-c25e40c0eb7a49575ed403526f7edd7fcc6239dda01fc19f85fd2d89407e491d3
IEDL.DBID DOA
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000715043900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1860-5974
IngestDate Fri Oct 03 12:35:23 EDT 2025
Sat Nov 29 06:21:51 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c306t-c25e40c0eb7a49575ed403526f7edd7fcc6239dda01fc19f85fd2d89407e491d3
OpenAccessLink https://doaj.org/article/a67cb9a1db0c45a7bab19cf3a4c50944
ParticipantIDs doaj_primary_oai_doaj_org_article_a67cb9a1db0c45a7bab19cf3a4c50944
crossref_primary_10_46298_lmcs_17_4_4_2021
PublicationCentury 2000
PublicationDate 2021-01-01
PublicationDateYYYYMMDD 2021-01-01
PublicationDate_xml – month: 01
  year: 2021
  text: 2021-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2021
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.4338167
Snippet Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables...
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - formal languages and automata theory
computer science - logic in computer science
Title Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
URI https://doaj.org/article/a67cb9a1db0c45a7bab19cf3a4c50944
Volume 17, Issue 4
WOSCitedRecordID wos000715043900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1JSwMxFA5SPHhxF3dy8KDSoZNO2ky8ubR4qEXBpbchqxTsqF0EL_5230taqScvMjADYSYTvpdM3pfJ-x4hR7lOwzSQNKAHJdApXKKM90kuU6Mwb5oNoj6PHdHt5r2evJ1L9YV7wqI8cASupprCaKmY1anhDSW00kwanyluUPstKIGC1zNHpsI3OMvQcY6_MXmzLvPay8CMEiaO-Rk_AcbPfk1Ec3r9YWJpr5LlqUdIz2NL1siCK9fJyizbAp0Ovg1S3k2URXsZ-gSMkbbeo0r3iOJaKu248hkumIAzpH0Yj6oUA85DHVGWvEpVaSluutAhGBreCU8OMIwx1nHVx1DzsF32c5M8tFv3l9fJNFtCYsDtHycGcOapSZ0WCliPaDjLUey06YWzVnhjwNOR1qqUecOkzxve1m0ugdE5LpnNtkilfC3dNqEW_JZMeG08sA3wtzQqtghXh1LmYJjukNMZdMVbFMUogEwEnAvEuWCi4HAgzjvkAsH9uRH1rEMBWLmYWrn4y8q7_1HJHlnCBsUFlH1SGQ8n7oAsmo9xfzQ8DB0IzjdfrW8SNM59
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quadratic+Word+Equations+with+Length+Constraints%2C+Counter+Systems%2C+and+Presburger+Arithmetic+with+Divisibility&rft.jtitle=Logical+methods+in+computer+science&rft.au=Anthony+W.+Lin&rft.au=Rupak+Majumdar&rft.date=2021-01-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=17%2C+Issue+4&rft_id=info:doi/10.46298%2Flmcs-17%284%3A4%292021&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a67cb9a1db0c45a7bab19cf3a4c50944
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon