Termination Proofs for String Rewriting Systems via Inverse Match-Bounds
- 1 May 2005
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 34 (4) , 365-385
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMSInternational Journal of Foundations of Computer Science, 2005
- Deleting string rewriting systems preserve regularityTheoretical Computer Science, 2004
- Match-Bounded String Rewriting SystemsApplicable Algebra in Engineering, Communication and Computing, 2004
- Termination and derivational complexity of confluent one-rule string-rewriting systemsTheoretical Computer Science, 2001
- On normalizing, non-terminating one-rule string rewriting systemsTheoretical Computer Science, 2000
- String-Rewriting Systems1993
- Termination of rewritingJournal of Symbolic Computation, 1987
- Transductions and Context-Free Languages1979
- Context-Limited GrammarsJournal of the ACM, 1974
- Mappings which preserve context sensitive languagesInformation and Control, 1966