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

DOI10.1007/bfb0037420zbMATH Open1541.68251MaRDI QIDQ6560192

A. 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

• Finite representations of CCS and TCSP programs by automata and Petri nets
• A short proof of the decidability of bisimulation for normed BPA- processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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