A polynomial algorithm for deciding bisimularity of normed context-free processes
Bookmark
ShareCopied to clipboardA polynomial algorithm for deciding bisimularity of normed context-free processes is a book. It was written by Yoram Hirshfeld and published by LFCS, Dept. of Computer Science, University of Edinburgh in 1994.
Key facts
- author: Yoram Hirshfeld
- publication date: 1994
- book publisher: LFCS, Dept. of Computer Science, University of Edinburgh
- book series: LFCS report series
- book subjects: Algorithms, Polynomials
See more factsExtract data
Download datasets about A polynomial algorithm for deciding bisimularity of normed context-free processes:
Dataset of books series that contain A polynomial algorithm for deciding bisimularity of normed context-free processes:
Dataset of book subjects that contain A polynomial algorithm for deciding bisimularity of normed context-free processes:
"A polynomial algorithm for deciding bisimularity of normed context-free processes" is one of the books by Yoram Hirshfeld, books by LFCS, Dept. of Computer Science, University of Edinburgh and 2,617,384 books in our database.
Related
Connected or similar to A polynomial algorithm for deciding bisimularity of normed context-free processes: .
This dashboard is based on data from: The British Library.
This content is available under the CC BY 4.0 license.