Search
for Author
All Reviews
Finkel, Alain
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
2
of
2
reviews
The logical view on continuous Petri nets
Blondin M., Finkel A., Haase C., Haddad S. ACM Transactions on Computational Logic 18(3): 1-28, 2017. Type: Article
The reachability problem for standard Petri nets is EXPSPACE hard, and the coverability problem is EXPSPACE complete. However, more efficient algorithms exist for variants of the standard nets. Continuous Petri nets are such a variant ...
...
Nov 17 2017
A polynomial algorithm for the membership problem with categorial grammars
Finkel A., Tellier I. Theoretical Computer Science 164(1-2): 207-221, 1996. Type: Article
Categorial grammars are a family of several related general frameworks for formal description of natural languages. The basic notion of these grammars, that of a semantic category, was formulated in 1935 by K. Ajdukiewicz, and some roo...
...
Jul 1 1997
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy