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.

Abstract: No abstracts yet.

BibTeX entry

@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 the Dyck 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
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.