An edition of A polynomial algorithm for deciding bisimularity of normed context-free processes (1994)

A polynomial algorithm for deciding bisimularity of normed context-free processes

by

A polynomial algorithm for deciding bisimular ...
Yoram Hirshfeld, Yoram Hirshfe ...
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
Notes

Buy this book

Last edited by WorkBot
December 15, 2009 | History
Edit
An edition of A polynomial algorithm for deciding bisimularity of normed context-free processes (1994)

A polynomial algorithm for deciding bisimularity of normed context-free processes

by

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
LFCS, Dept. of Computer Science, University of Edinburgh
Language
English
Pages
27

Buy this book

Subjects

Algorithms, Equivalence (Linguistics), Polynomials

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: A polynomial algorithm for deciding bisimularity of normed context-free processes
A polynomial algorithm for deciding bisimularity of normed context-free processes
1994, LFCS, Dept. of Computer Science, University of Edinburgh
in English
  • Not in Library

Add another edition?

Book Details

Edition Notes

Includes bibliographical references.

Published in
Edinburgh
Series
LFCS reportseries -- ECS-LFCS-94-286

The Physical Object

Pagination
27 p. ;
Number of pages
27

ID Numbers

Open Library
OL19162258M

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
December 15, 2009 Edited by WorkBot link works
October 21, 2008 Created by ImportBot Imported from Talis record