Title
Decidability of bisimulation equivalence for normed pushdown processes
Abstract
As a service to our readers, SIGACT News has an agreement with Computing Reviews to reprint reviews of books and articles of interest to the theoretical computer science community. Computing Reviews is a monthly journal that publishes critical reviews on a broad range of computing subjects, including models of computation, formal languages, computational complexity theory, analysis of algorithms, and logics and semantics of programs. ACM members can receive a subscription to Computing Reviews for $45 per year by writing to ACM headquarters.
Year
DOI
Venue
1996
10.1145/333623.333624
ACM SIGACT News
Keywords
Field
DocType
informatics,pushdown automata,technical report
Discrete mathematics,Context-free language,Context-free grammar,Concurrency,Deterministic pushdown automaton,Decidability,Process calculus,Mathematics,Bisimulation equivalence,Language family
Conference
Volume
Issue
Citations 
30
3
44
PageRank 
References 
Authors
2.24
26
1
Name
Order
Citations
PageRank
Colin Stirling1934102.50