Skip to main content
SpringerLink
Log in

Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In this paper we study the satisfiability problem for language equations and constraints between regular open terms. We prove that: the constraint problem is PSPACE-complete, the regular language matching problem is EXPSPACE-complete even if we ask about satisfiability by regular languages, satisfiability of word-like language equations is in PSPACE, the finite solution problem is EXPSPACE-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51151 Wroclaw, Poland

    Sebastian Bala

Authors
  1. Sebastian Bala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastian Bala.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bala, S. Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. Theory Comput Syst 39, 137–163 (2006). https://doi.org/10.1007/s00224-005-1262-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1262-y

Keywords

Search

Navigation