-
Deriving Unbounded Petri Nets from Formal Languages
We propose decision procedures based on regions for two problems on pure unbounded Petri nets with injective labelling. One problem is to construct nets from... -
On the Complexity of Membership and Counting in Height-Deterministic Pushdown...
International audience -
Topological Complexity of Context-Free omega-Languages: A Survey
International audience
