An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:31, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems |
scientific article |
Statements
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (English)
0 references
1985
0 references
\textit{R. V. Book} and \textit{C. P. O'Dunlaing} [Theor. Comput. Sci. 16, 223- 229 (1981; Zbl 0479.68035)] have given an algorithm of time complexity \(O(| T|^ 6)\) which decides whether a Thue system T is Church- Rosser or not. The present paper describes an algorithm of time complexity \(O(| T|^ 3)\) which answers this question, too.
0 references
