|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 10 of 26 found articles
| Title: |
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms |
| Author: |
Bala, Sebastian |
| Appeared in: |
Theory of computing systems |
| Paging: | Volume 39 (2005) nr. 1 pages 137-163 |
| Year: |
2005 |
| Contents: | |
| Publisher: |
Springer-Verlag, New York |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 10 of 26 found articles
| << previous | next >> |