Star-free languages are Church–Rosser congruential
Saved in:
| Title: | Star-free languages are Church–Rosser congruential |
|---|---|
| Authors: | Diekert, Volker1, Kufleitner, Manfred1, kufleitner@fmi.uni-stuttgart.de, Weil, Pascal2,3 |
| Source: | Theoretical Computer Science; Oct2012, Vol. 454, p129-135, 7p |
| Database: | Applied Science & Technology Source |
| ISSN: | 03043975 |
|---|---|
| DOI: | 10.1016/j.tcs.2012.01.028 |
