FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (Q5462118)
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: FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS |
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
