On the public citation graph
Petri net algorithms in the theory of matrix grammars
0 signed · 91 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50580-6_33openalex-snapshot
Some consequences of the decidability of the reachability problem for Petri nets
inferredcites →https://doi.org/10.1007/978-3-642-74932-2openalex-snapshot
Regulated Rewriting in Formal Language Theory
inferredcites →https://doi.org/10.1007/bf00263503openalex-snapshot
Scattered versus context-sensitive rewriting
inferredcites →https://doi.org/10.1016/0304-3975(89)90055-8openalex-snapshot
Projections of vector addition system reachability sets are semilinear
inferredcites →https://doi.org/10.1016/0304-3975(92)90002-wopenalex-snapshot
The context-freeness of the languages associated with vector addition systems is decidable
inferredcites →https://doi.org/10.1016/0376-5075(81)90061-1openalex-snapshot
1981 international computing symposium
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.3233/fi-1992-16105openalex-snapshot
On the Generative Capacity of Context-Free Matrix Grammars over One-Letter Alphabet
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_9openalex-snapshot
Two Normal Forms for Rewriting P Systems
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_9openalex-snapshot
P Systems with Gemmation of Mobile Membranes
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_18openalex-snapshot
Rewriting P Systems with Conditional Communication
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_94openalex-snapshot
Grammar systems: A grammatical approach to distribution and cooperation
inferred← citeshttps://doi.org/10.1007/3-540-62844-4_14openalex-snapshot
A note on the incomparability of the E0L family with certain families of languages generated by cooperating grammar systems
inferred← citeshttps://doi.org/10.1007/3-540-62844-4_2openalex-snapshot
Conditional context-free languages of finite index
inferred← citeshttps://doi.org/10.1007/3-540-62844-4_7openalex-snapshot
Accepting array grammars with control mechanisms
inferred← citeshttps://doi.org/10.1007/978-1-4615-0753-6_18openalex-snapshot
Membrane Systems for Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-23247-4_8openalex-snapshot
Descriptional Complexity of Matrix Simple Semi-conditional Grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_42openalex-snapshot
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III
inferred← citeshttps://doi.org/10.1007/978-3-030-77102-7_3openalex-snapshot
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_20openalex-snapshot
On Computational Completeness of Semi-Conditional Matrix Grammars
inferred← citeshttps://doi.org/10.1007/978-3-031-97100-6_7openalex-snapshot
Matrix Forbidding Grammars
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_5openalex-snapshot
Relativized Codes, Finite Decodability, and Bounded Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-28475-0_4openalex-snapshot
Polarizationless P Systems with One Active Membrane
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_15openalex-snapshot
Parikh Images of Matrix Ins-Del Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-94631-3_14openalex-snapshot
State Grammars with Stores
inferred← citeshttps://doi.org/10.1007/978-3-540-27812-2_21openalex-snapshot
P Systems with Tables of Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_13openalex-snapshot
Grammars With Regulated Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_19openalex-snapshot
Labeled Step Sequences in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_20openalex-snapshot
k-Petri Net Controlled Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_14openalex-snapshot
On Nonuniversal Symport/Antiport P Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_40openalex-snapshot
Erasing in Petri Net Languages and Matrix Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_15openalex-snapshot
On Erasing Productions in Random Context Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-20000-7_8openalex-snapshot
On the Expressive Power of Valences in Cooperating Distributed Grammar Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-20000-7_9openalex-snapshot
Generative Power of Eco-Colonies
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_3openalex-snapshot
Grammars with Controlled Derivations
inferred← citeshttps://doi.org/10.1007/s00236-004-0153-zopenalex-snapshot
Trading polarizations for labels in P systems with active membranes
inferred← citeshttps://doi.org/10.1007/s002360050108openalex-snapshot
Unconditional transfer in regulated rewriting
inferred← citeshttps://doi.org/10.1007/s002360050125openalex-snapshot
DNA computing, sticker systems, and universality
inferred← citeshttps://doi.org/10.1007/s41965-023-00127-8openalex-snapshot
On maximal parallel application of rules in rewriting P systems
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104688openalex-snapshot
On the computational completeness of matrix simple semi-conditional grammars
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.006openalex-snapshot
From regulated rewriting to computing with membranes: collapsing hierarchies
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.053openalex-snapshot
On the power of membrane division in P systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.009openalex-snapshot
A multiset-based model of synchronizing agents: Computability and robustness
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.003openalex-snapshot
Decision problems in membrane systems with peripheral proteins, transport and evolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.013openalex-snapshot
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.010openalex-snapshot
Left-forbidding cooperating distributed grammar systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.013openalex-snapshot
On trace languages generated by (small) spiking neural P systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114539openalex-snapshot
On the computational completeness of generalized forbidding matrix grammars
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00114-3openalex-snapshot
Min of Mat is not necessarily Mat
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00022-0openalex-snapshot
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00541-8openalex-snapshot
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes ⩽k and =k
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00581-9openalex-snapshot
On three variants of rewriting P systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00656-4openalex-snapshot
Nonterminal complexity of programmed grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00657-6openalex-snapshot
Gemmating P systems: collapsing hierarchies
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00329-5openalex-snapshot
Remarks on regulated limited ETOL systems and regulated context-free grammars
inferred← citeshttps://doi.org/10.1051/ita/1997310403311openalex-snapshot
On the power of parallel communicating grammar systems with right-linear components
inferred← citeshttps://doi.org/10.1051/ita:2004013openalex-snapshot
On differentiation functions, structure functions, and related languages of context-free grammars
inferred← citeshttps://doi.org/10.1080/00207160108805116openalex-snapshot
P systems with energy accounting∗
inferred← citeshttps://doi.org/10.1080/00207160601065439openalex-snapshot
On symport/antiport P systems with a small number of objects
inferred← citeshttps://doi.org/10.1080/00207169808804705openalex-snapshot
Convex and anti-convex languages
inferred← citeshttps://doi.org/10.1109/spire.2000.878181openalex-snapshot
Computing with membranes: P systems with worm-objects
inferred← citeshttps://doi.org/10.1109/synasc.2005.52openalex-snapshot
On symport/antiport P systems with one or two symbols
inferred← citeshttps://doi.org/10.1142/s012905410600367xopenalex-snapshot
CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES
inferred← citeshttps://doi.org/10.1142/s012905410700525xopenalex-snapshot
PROGRAMMED GRAMMARS WITH RULE QUEUES
inferred← citeshttps://doi.org/10.1142/s0129054108005917openalex-snapshot
TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS
inferred← citeshttps://doi.org/10.1142/s0129054111008118openalex-snapshot
TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS
inferred← citeshttps://doi.org/10.1142/s012905419900006xopenalex-snapshot
ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS
inferred← citeshttps://doi.org/10.1145/3661814.3662133openalex-snapshot
Verifying Unboundedness via Amalgamation
inferred← citeshttps://doi.org/10.2306/scienceasia1513-1874.2017.43s.009openalex-snapshot
Place-labelled Petri net controlled grammars
inferred← citeshttps://doi.org/10.25596/jalc-2006-263openalex-snapshot
Event-Related Outputs of Computations in P Systems
inferred← citeshttps://doi.org/10.25596/jalc-2007-117openalex-snapshot
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars
inferred← citeshttps://doi.org/10.3217/jucs-002-11-0745openalex-snapshot
Remarks on Propagating Partition-Limited ETOL Systems
inferred← citeshttps://doi.org/10.3233/fi-1998-36231openalex-snapshot
Remarks on the Relationship Between Cooperating Distributed Grammar Systems and Lindenmayer Systems
inferred← citeshttps://doi.org/10.3233/fi-1999-38404openalex-snapshot
On Synchronization in P Systems
inferred← citeshttps://doi.org/10.3233/fi-2000-41304openalex-snapshot
Membrane Computing with External Output
inferred← citeshttps://doi.org/10.3233/fi-2009-0099openalex-snapshot
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata
inferred← citeshttps://doi.org/10.3233/fun-2001-45403openalex-snapshot
Valences in Lindenmayer Systems
inferred← citeshttps://doi.org/10.3390/a14050131openalex-snapshot
Adding Matrix Control: Insertion-Deletion Systems with Substitutions III
inferred← citeshttps://doi.org/10.4204/eptcs.3.18openalex-snapshot
Capacity Bounded Grammars and Petri Nets
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.