Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completing a finite special string-rewriting system on the congruence class of the empty word |
scientific article; zbMATH DE number 60278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completing a finite special string-rewriting system on the congruence class of the empty word |
scientific article; zbMATH DE number 60278 |
Statements
Completing a finite special string-rewriting system on the congruence class of the empty word (English)
0 references
27 September 1992
0 references
monoid-presentation
0 references
\(e\)-confluence
0 references
completion procedure
0 references
string- rewriting systems
0 references
0 references
0 references
