An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90008-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080604675 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Confluent and Other Types of Thue Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Testing for the Church-Rosser property / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Proving Uniform Termination and Restricted Termination of Rewriting Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4105657 / rank | |||
Normal rank | |||
Latest revision as of 17:29, 14 June 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
