"Complexity of Regular Language Matching and Other Decidable Cases of the ..."

Sebastian Bala (2006)

> Home

Details and statistics

DOI: 10.1007/S00224-005-1262-Y

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Bala06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Bala06
Sebastian Bala:
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. Theory Comput. Syst. 39(1): 137-163 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.