scientific article; zbMATH DE number 3932399
[For the entire collection see Zbl 0527.00035.] We first show that unlabelled monogeneous nets are more powerful than unlabelled Petri nets. As a matter of fact there exists a language \((abba)^*\), which is recognized by an unlabelled monogeneous net but which is not recognized by any unlabelled Petri net. We then show that there exist regular controls which preserve the lack of label. More precisely, we associate a certain number of finite automata \(K_ i\) to every unlabelled Petri net N, so that the intersection of the language of N with the language of \(K_ i\) is exactly the language of an unlabelled monogeneous net \(M_ i\), which we define in an explicit manner.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704895)