No label defined (Q3704895)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3932399
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3932399

      Statements

      1983
      0 references
      unlabelled monogeneous nets
      0 references
      unlabelled Petri nets
      0 references
      regular controls
      0 references
      finite automata
      0 references
      0 references
      [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.
      0 references

      Identifiers