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

DOI10.1007/BFB0037420zbMATH Open1541.68251MaRDI QIDQ6560192FDOQ6560192

Antonin Kučera

Publication date: 21 June 2024

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?)
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• A short proof of the decidability of bisimulation for normed BPA- processes

This page was built for publication: Regularity is decidable for normed BPA and normed BPP processes in polynomial time

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