Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms (Q2432531)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms |
scientific article |
Statements
Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms (English)
0 references
25 October 2006
0 references
