Decision problems for finite special string-rewriting systems that are confluent on some congruence class

1991/05/01 by Friedrich Otto, Louxin Zhang · 3 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #semigroups and automata theory

paper · doi:10.1007/bf01178585

crossref issued 1991/05/01 · crossref published 1991/05/01 · crossref published-print 1991/05/01 · openalex publication_date 1991/05/01 · crossref created 2005/02/17 · crossref deposited 2024/01/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23 · crossref indexed 2026/07/30

Citations

• Fast Pattern Matching in Strings

Cited by

• Two-sided homological properties of special and one-relator monoids
• The Word Problem for One-relation Monoids: A Survey
• Right Divisibility in Erasing Semi-Thue Systems: A Minimal View of Intruder Deduction