Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Unexpected universality results for three classes of P systems with symport/antiport
Natural Computing: an international journal
Computing with Cells: Advances in Membrane Computing
Computing with Cells: Advances in Membrane Computing
P systems, petri nets, and program machines
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 5.23 |
Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow. Here we continue this line of research by introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only by join. Moreover, we study how J languages relate to other families of formal languages.