Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90167-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979249711 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems |
scientific article |
Statements
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (English)
0 references
1989
0 references
finite monadic Church-Rosser Thue systems
0 references
rewriting systems
0 references
uniform decision problems
0 references
uniform conjugacy problem
0 references
