A short proof of the decidability of bisimulation for normed BPA- processes
type: Item
instance of: scholarly article
title: A short proof of the decidability of bisimulation for normed BPA- processes
zbMATH Open document ID: 0779.68029
DOI: 10.1016/0020-0190(92)90142-I
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 92112
zbMATH Keywords: formal semantics
zbMATH Keywords: basic progress algebra
zbMATH Keywords: context-free processes
zbMATH Keywords: decidability
zbMATH Keywords: decidability of bisimulation
author: Jan Friso Groote
MaRDI profile type: Publication
cites work: Q3774929
cites work: Graphes canoniques de graphes algébriques
cites work: Actions speak louder than words: proving bisimilarity for context-free processes
cites work: Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
cites work: Q3907077
full work available at URL: 0020-0190(92)90142-i
OpenAlex ID: W2008587618
description: scientific article; zbMATH DE number 92112