On languages accepted by
P/T systems composed by join
Recently the study of place/transition systems whose underlying net
is composed only by join and fork, basic nets called building blocks, was
introduced. It was proved that such study can facilitate the study and
understanding of computing devices based on multiset rewriting.
Here we continue this line of research introducing J languages and
proving that they can be accepted by place/transition systems whose underlying
net is composed only by join. Moreover, we prove that J languages
are a proper subset of context sensitive languages.