When can one finite monoid simulate another?

MaRDI QIDQ4942278zbMATH OpenFDO

Authors Howard Straubing

Publication date 21 March 2000

zbMATH Keywords

circuit complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• MONOIDS AND COMPUTATIONS
• scientific article; zbMATH DE number 459361
• scientific article; zbMATH DE number 988809
• Finite Monoids: From Word to Circuit Evaluation
• Multiparty communication complexity of finite monoids

Cited in

(6)

• Computations over finite monoids and their test complexity
• scientific article; zbMATH DE number 1521554 (Why is no real title available?)
• MONOIDS AND COMPUTATIONS
• scientific article; zbMATH DE number 1916674 (Why is no real title available?)
• Tameness and the power of programs over monoids in \(\mathbf{DA}\)
• Over Which Monoids is the Transducer Determinization Procedure Applicable?

This page was built for publication: When can one finite monoid simulate another?

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