scientific article; zbMATH DE number 2068882

MaRDI QIDQ4465343zbMATH OpenFDO

Authors Ferucio Laurenţiu Ţiplea, Erkki Mäkinen

Publication date 27 May 2004

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• About the descriptive power of certain classes of finite string-rewriting systems
• Some results on Green's relations for monoids presented by monadic string-rewriting systems
• scientific article; zbMATH DE number 789389
• On weakly confluent monadic string-rewriting systems
• On the complexity of some extended word problems defined by cancellation rules

Cited in

(3)

• From Hertzsprung's problem to pattern-rewriting systems
• scientific article; zbMATH DE number 4049112 (Why is no real title available?)
• scientific article; zbMATH DE number 6819785 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465343)