Petri net algorithms in the theory of matrix grammars
From MaRDI portal
Publication:1342504
DOI10.1007/BF01178731zbMath0834.68064MaRDI QIDQ1342504
Dirk Hauschildt, Matthias Jantzen
Publication date: 16 February 1995
Published in: Acta Informatica (Search for Journal in Brave)
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (37)
On trace languages generated by (small) spiking neural P systems ⋮ On the power of membrane division in P systems ⋮ Adding matrix control: insertion-deletion systems with substitutions. III ⋮ From regulated rewriting to computing with membranes: collapsing hierarchies ⋮ On differentiation functions, structure functions, and related languages of context-free grammars ⋮ Remarks on regulated limited ET0L systems and regulated context-free grammars ⋮ On three variants of rewriting P systems ⋮ Nonterminal complexity of programmed grammars. ⋮ Gemmating P systems: Collapsing hierarchies. ⋮ Tissue P systems. ⋮ TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS ⋮ Parikh Images of Matrix Ins-Del Systems ⋮ k-Petri Net Controlled Grammars ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ On the Expressive Power of Valences in Cooperating Distributed Grammar Systems ⋮ Generative Power of Eco-Colonies ⋮ Grammar systems: A grammatical approach to distribution and cooperation ⋮ Decision problems in membrane systems with peripheral proteins, transport and evolution ⋮ On the power of parallel communicating grammar systems with right-linear components ⋮ A multiset-based model of synchronizing agents: Computability and robustness ⋮ State grammars with stores ⋮ P systems with energy accounting∗ ⋮ Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization ⋮ Trading polarizations for labels in P systems with active membranes ⋮ Left-forbidding cooperating distributed grammar systems ⋮ CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES ⋮ TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS ⋮ Generalized forbidding matrix grammars and their membrane computing perspective ⋮ An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations ⋮ Erasing in Petri Net Languages and Matrix Grammars ⋮ PROGRAMMED GRAMMARS WITH RULE QUEUES ⋮ Convex and anti-convex languages ⋮ Computing with membranes ⋮ ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS ⋮ On symport/antiport P systems with a small number of objects ⋮ Min of Mat is not necessarily Mat ⋮ On the computational completeness of matrix simple semi-conditional grammars
Cites Work
- Scattered versus context-sensitive rewriting
- The context-freeness of the languages associated with vector addition systems is decidable
- Projections of vector addition system reachability sets are semilinear
- An Algorithm for the General Petri Net Reachability Problem
- One-way stack automata
- Programmed Grammars and Classes of Formal Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Petri net algorithms in the theory of matrix grammars
