Author:
K. Čulík Computer Science Department Wayne State University 48202 Detroit MI U.S.A.

Search for other papers by K. Čulík in
Current site
Google Scholar
PubMed
Close
Restricted access

The graph of a set grammar is introduced in such a way that each set rule of the grammar is represented by a cartesian subgraph of it. The correspondence between cartesian subgraphs and transitions of Petri nets (which satisfy the axiom of extensionality) is established. The set grammars with input (initial) and output (terminal) elements are studied in an analogy to Chomsky's string grammars and their strong equivalence. Permit rules and parallel permit rules are introduced in such a way that parallel permit grammars are more general tools than Petri nets themselves, because the equivalence between homogeneous parallel permit grammars and set grammars (and Petri nets) is proved.

  • Collapse
  • Expand

To see the editorial board, please visit the website of Springer Nature.

Manuscript Submission: HERE

For subscription options, please visit the website of Springer Nature.

Periodica Mathematica Hungarica
Language English
Size B5
Year of
Foundation
1971
Volumes
per Year
2
Issues
per Year
4
Founder Bolyai János Matematikai Társulat - János Bolyai Mathematical Society
Founder's
Address
H-1055 Budapest, Hungary Falk Miksa u. 12.I/4.
Publisher Akadémiai Kiadó
Springer Nature Switzerland AG
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
CH-6330 Cham, Switzerland Gewerbestrasse 11.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0031-5303 (Print)
ISSN 1588-2829 (Online)

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Feb 2024 7 1 0
Mar 2024 19 0 0
Apr 2024 21 0 0
May 2024 0 0 0
Jun 2024 6 0 1
Jul 2024 0 0 0
Aug 2024 0 0 0