Confluence of One-Rule Thue Systems
暂无分享,去创建一个
[1] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[3] Ronald V. Book,et al. Homogeneous Thue systems and the Church-Rosser property , 1984, Discret. Math..
[4] Paliath Narendran,et al. A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System , 1985, Theor. Comput. Sci..
[5] Paliath Narendran,et al. An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems , 1985, Theor. Comput. Sci..
[6] Matthias Jantzen,et al. Confluent String Rewriting , 1988, EATCS Monographs on Theoretical Computer Science.
[7] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[8] Klaus Madlener,et al. String matching and algorithmic problems in free groups , 1980 .
[9] Colm Ó'Dúnlaing,et al. Testing for the Church-Rosser Property , 1981, Theor. Comput. Sci..
[10] Zvi Galil,et al. Time-Space-Optimal String Matching , 1983, J. Comput. Syst. Sci..
[11] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.