Abstract
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. © 2010 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 3905-3916 |
Number of pages | 12 |
Journal | Theoretical Computer Science |
Volume | 411 |
Issue number | 44-46 |
DOIs | |
Publication status | Published - 25 Oct 2010 |
Keywords
- J languages
- Join
- P/T systems