scientific article; zbMATH DE number 1232246

zbMATH Open0907.68179MaRDI QIDQ4223072

Jitka Stříbrná

Publication date: 3 January 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

Gröbner basesdecidabilityHilbert's basis theorem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

More on Weak Bisimilarity of Normed Basic Parallel Processes ⋮ Title not available (Why is that?) ⋮ Non-interleaving bisimulation equivalences on basic parallel processes

Recommendations

• Non-interleaving bisimulation equivalences on basic parallel processes 👍 👎
• A short proof of the decidability of bisimulation for normed BPA- processes 👍 👎
• Decidability of bisimulation equivalence for normed pushdown processes 👍 👎
• Strong bisimilarity of simple process algebras: Complexity lower bounds 👍 👎
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes 👍 👎
• 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?) 👍 👎

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 Q4223072)