On sets of numbers accepted by P/T systems composed by join

Pierluigi Frisco, Oscar H. Ibarra

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)3905-3916
Number of pages12
JournalTheoretical Computer Science
Volume411
Issue number44-46
DOIs
Publication statusPublished - 25 Oct 2010

Fingerprint

Join
Topology
Computing
Formal Languages
Multiset
Transition Systems
Information Flow
Rewriting
Petri Nets
Continue
Line
Language
Model
Family

Keywords

  • J languages
  • Join
  • P/T systems

Cite this

Frisco, Pierluigi ; Ibarra, Oscar H. / On sets of numbers accepted by P/T systems composed by join. In: Theoretical Computer Science. 2010 ; Vol. 411, No. 44-46. pp. 3905-3916.
@article{c46c9f6f08c44554b3023da148e4b4fb,
title = "On sets of numbers accepted by P/T systems composed by join",
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. {\circledC} 2010 Elsevier B.V. All rights reserved.",
keywords = "J languages, Join, P/T systems",
author = "Pierluigi Frisco and Ibarra, {Oscar H.}",
year = "2010",
month = "10",
day = "25",
doi = "10.1016/j.tcs.2010.07.016",
language = "English",
volume = "411",
pages = "3905--3916",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "44-46",

}

On sets of numbers accepted by P/T systems composed by join. / Frisco, Pierluigi; Ibarra, Oscar H.

In: Theoretical Computer Science, Vol. 411, No. 44-46, 25.10.2010, p. 3905-3916.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On sets of numbers accepted by P/T systems composed by join

AU - Frisco, Pierluigi

AU - Ibarra, Oscar H.

PY - 2010/10/25

Y1 - 2010/10/25

N2 - 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.

AB - 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.

KW - J languages

KW - Join

KW - P/T systems

UR - http://www.scopus.com/inward/record.url?scp=77957673660&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2010.07.016

DO - 10.1016/j.tcs.2010.07.016

M3 - Article

VL - 411

SP - 3905

EP - 3916

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 44-46

ER -