Regularity is decidable for normed PA processes in polynomial time

DOI10.1007/3-540-62034-6_42zbMATH Open1541.68252MaRDI QIDQ6567761FDOQ6567761

Authors: Antonin Kučera 

Publication date: 5 July 2024

Recommendations

• Regularity of normed PA processes
• Regularity is decidable for normed BPA and normed BPP processes in polynomial time
• Checking equality and regularity for normed BPA with silent moves
• scientific article; zbMATH DE number 2102747
• scientific article; zbMATH DE number 1231554

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation collapse and the process taxonomy
• Title not available (Why is that?)
• Title not available (Why is that?)
• A short proof of the decidability of bisimulation for normed BPA- processes
• Regularity is decidable for normed PA processes in polynomial time

Cited In (2)

• Regularity is decidable for normed BPA and normed BPP processes in polynomial time
• Regularity is decidable for normed PA processes in polynomial time

This page was built for publication: Regularity is decidable for normed PA processes in polynomial time

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