On the complexity of reasoning in Kleene algebra with commutativity conditions

DOI10.1007/978-3-031-47963-2_7MaRDI QIDQ6605343

Stepan Kuznetsov

Publication date: 13 September 2024

zbMATH Keywords

algorithmic complexityKleene algebracommutativity conditions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decidability of some problems about rational subsets of free partially commutative monoids
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Infinitary action logic with exponentiation
• Kleene algebra with hypotheses
• On the complexity of reasoning in Kleene algebra
• A note on hereditarily Π10- and Σ10-complete sets of sentences
• On Action Logic: Equational Theories of Action Algebras
• Kleene Algebra with Equations
• Creative sets
• Reordering Derivatives of Trace Closures of Regular Languages.

This page was built for publication: On the complexity of reasoning in Kleene algebra with commutativity conditions

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