Back to Results
—out of 5—out of 5—out of 5—out of 5—out of 5—out of 5
Magical Tome
- First published
- 1992
- Publisher
- Springer
- Pages
- 487 pages
- ISBN
- 9780387551791
Computer Aided Verification: 3rd International Workshop, Cav 92
The outer archives are busy
About this book
In their paper [BBK87] Baeten, Bergstra, and Klop showed that strong bisimulation equivalence is decidable for normed recursively defined BPA processes [BK88], a class of processes corresponding to that of irredundant context-free grammars without empty productions.
Match Score
Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.
Create free accountMarks of the Realm
Marks left by readers of this tome
No community marks yet — be the first to inscribe this tome.
Pacing
Horror / Dark Elements
Romance
Spice Level
LGBTQ+ Representation
Social & Political Themes in Stories