Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems |
scientific article; zbMATH DE number 4110114 |
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
0.8327913880348206
0 references
0.8312769532203674
0 references
0.8288770914077759
0 references
0.8239223957061768
0 references
