Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138)
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: Termination and derivational complexity of confluent one-rule string-rewriting systems |
scientific article; zbMATH DE number 1715104
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Termination and derivational complexity of confluent one-rule string-rewriting systems |
scientific article; zbMATH DE number 1715104 |
Statements
Termination and derivational complexity of confluent one-rule string-rewriting systems (English)
0 references
3 March 2002
0 references
termination problem
0 references
string rewriting system
0 references
derivation complexity
0 references
