Publication:4036570
From MaRDI portal
zbMath0769.68061MaRDI QIDQ4036570
Paliath Narendran, Friedrich Otto, Klaus Madlener
Publication date: 18 May 1993
68Q42: Grammars and rewriting systems
Related Items
A polynomial algorithm testing partial confluence of basic semi-Thue systems, Completing a finite special string-rewriting system on the congruence class of the empty word, Computing presentations for subgroups of polycyclic groups and of context-free groups, The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems