On Languages Accepted by P/T Systems Composed of joins

@inproceedings{Frisco2009OnLA,
  title={On Languages Accepted by P/T Systems Composed of joins},
  author={Pierluigi Frisco and Oscar H. Ibarra},
  booktitle={DCFS},
  year={2009}
}
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 introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is… 

Figures from this paper

P Systems and Topology: Some Suggestions for Research

This paper summarise the known results on this topic and a few suggestions for research are listed, together with the relevance of possible outcomes.

Conformon P Systems and Topology of Information Flow

  • P. Frisco
  • Mathematics
    Workshop on Membrane Computing
  • 2009
Some of the results about conformon P systems are surveyed and these results are linked to the topology of information flow, which is studied with models of Petri nets.

References

SHOWING 1-10 OF 13 REFERENCES

Some Decision Problems Concerning Semilinearity and Commutation

If the languages defined by M are effectively semilinear, then so are the languagesdefined by Mc, and, hence, their emptiness problem is decidable, and this work proves a surprising undecidability result for commutation of languages.

Simple Matrix Languages

  • O. Ibarra
  • Computer Science, Mathematics
    Inf. Control.
  • 1970

PETRI NET LANGUAGE

This chapter considers the closure properties of the Petri Net Languages, their characterization, their relation to other language families, and the decidability of various problems concerning these languages.

Language Theory of Petri Nets

  • M. Jantzen
  • Computer Science
    Advances in Petri Nets
  • 1986
Petri nets where multiple arcs are allows and the capacity of the places need not be bounded are here called Place/Transition systems and give the basis to define families of formal languages related to classes of P/T-systems.

Computing with Membranes

  • G. Paun
  • Computer Science
    J. Comput. Syst. Sci.
  • 2000
It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.

P Systems, Petri Nets, and Program Machines

  • P. Frisco
  • Computer Science
    Workshop on Membrane Computing
  • 2005
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtained results are

2008):A hierarchy of computational processes

  • Technical Report HW-MACS-TR-0059,
  • 2008

Computing with Cells - Advances in Membrane Computing

Computing with Cells