FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (Q5462118): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:58, 9 February 2024
scientific article; zbMATH DE number 2190067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS |
scientific article; zbMATH DE number 2190067 |
Statements
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (English)
0 references
1 August 2005
0 references
String rewriting systems
0 references
termination
0 references
finite automata
0 references
match bounds
0 references
