"A polynomial algorithm for deciding bisimularity of normed context-free processes" - Information and Links:

A polynomial algorithm for deciding bisimularity of normed context-free processes - Info and Reading Options

"A polynomial algorithm for deciding bisimularity of normed context-free processes" was published by LFCS, Dept. of Computer Science, University of Edinburgh in 1994 - Edinburgh, it has 27 pages and the language of the book is English.


“A polynomial algorithm for deciding bisimularity of normed context-free processes” Metadata:

  • Title: ➤  A polynomial algorithm for deciding bisimularity of normed context-free processes
  • Author:
  • Language: English
  • Number of Pages: 27
  • Publisher: ➤  LFCS, Dept. of Computer Science, University of Edinburgh
  • Publish Date:
  • Publish Location: Edinburgh

“A polynomial algorithm for deciding bisimularity of normed context-free processes” Subjects and Themes:

Edition Specifications:

  • Pagination: 27 p. ;

Edition Identifiers:

AI-generated Review of “A polynomial algorithm for deciding bisimularity of normed context-free processes”:


Read “A polynomial algorithm for deciding bisimularity of normed context-free processes”:

Read “A polynomial algorithm for deciding bisimularity of normed context-free processes” by choosing from the options below.

Search for “A polynomial algorithm for deciding bisimularity of normed context-free processes” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “A polynomial algorithm for deciding bisimularity of normed context-free processes” in Libraries Near You:

Read or borrow “A polynomial algorithm for deciding bisimularity of normed context-free processes” from your local library.

Buy “A polynomial algorithm for deciding bisimularity of normed context-free processes” online:

Shop for “A polynomial algorithm for deciding bisimularity of normed context-free processes” on popular online marketplaces.