The following pages link to Context-Limited Grammars (Q4042666):
Displaying 5 items.
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (Q5462118) (← links)
