AC
2003
Springer
14 years 17 days 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...