On Weakly Confluent Monadic String-Rewriting Systems

Abstract

Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that… (More)
DOI: 10.1016/0304-3975(93)90213-D

Topics

  • Presentations referencing similar topics