When Church-Rosser Becomes Context Free
暂无分享,去创建一个
[1] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.
[2] Paliath Narendran,et al. Complexity of Certain Decision Problems about Congruential Languages , 1985, J. Comput. Syst. Sci..
[3] Paliath Narendran,et al. Church-Rosser Thue systems and formal languages , 1988, JACM.
[4] Friedrich Otto,et al. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages , 2005, Inf. Comput..
[5] Y. Cochet,et al. Une Generalisation des Ensembles de Dyck , 1971 .
[6] Gerhard Buntrock,et al. Growing Context-Sensitive Languages and Church-Rosser Languages , 1998, Inf. Comput..