Bibliography
Twisting Petri net languages and how to obtain them by reducing linear context-free sets
Matthias Jantzen and Holger Petersen.
Twisting Petri net languages and how to obtain them by reducing
linear context-free sets.
In Proceedings of the 12th International Conference on
Application and Theory of Petri Nets (Gjern, Denmark, 1991), pages
228-236, Gjern, June 1991.
BibTeX
@inproceedings{Jantzen+91,
Abstract = {It was shown by the authors (1987) (see PN-Newsletter 27, p. 69)
that all terminal Petri net languages can be obtained from general context-free sets
by complete cancellation of substrings from the Dyck set with one pair of parentheses,
the so-called Dyck_1-reduction. The authors generalize this characterization by
showing that linear context-free languages suffice and that theDyck set can be
replaced by a simpler bounded language. In proving this the authors obtain a new
closure property of the family of Petri net languages which is not shared by the
context-free sets.},
Address = {Gjern},
Author = {Jantzen, Matthias and Petersen, Holger},
Booktitle = {Proceedings of the 12th International Conference on Application and Theory of {Petri} Nets (Gjern, Denmark, 1991)},
Month = jun,
Pages = {228--236},
Title = {Twisting {Petri} net languages and how to obtain them by reducing linear context-free sets},
Year = 1991
}
