AC
2003
Springer
15 years 2 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...