Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)

DOI10.1006/INCO.1995.1069zbMath0826.68043OpenAlexW2057288336MaRDI QIDQ1892892

Dung T. Huynh, Didier Caucal, L. Tian

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1069

zbMATH Keywords

branching bisimulation equivalencenormed context-free processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

A generic framework for checking semantic equivalences between pushdown automata and finite-state automata

This page was built for publication: Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)