Petri net algorithms in the theory of matrix grammars

DOI10.1007/BF01178731zbMath0834.68064MaRDI QIDQ1342504

Dirk Hauschildt, Matthias Jantzen

Publication date: 16 February 1995

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

On the power of parallel communicating grammar systems with right-linear components, On differentiation functions, structure functions, and related languages of context-free grammars, 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, Decision problems in membrane systems with peripheral proteins, transport and evolution, An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations, 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., Computing with membranes, Min of Mat is not necessarily Mat, On the power of membrane division in P systems, From regulated rewriting to computing with membranes: collapsing hierarchies, A multiset-based model of synchronizing agents: Computability and robustness, P systems with energy accounting^∗, On the Expressive Power of Valences in Cooperating Distributed Grammar Systems, Generative Power of Eco-Colonies, TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS, CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES, PROGRAMMED GRAMMARS WITH RULE QUEUES, On symport/antiport P systems with a small number of objects, TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS, k-Petri Net Controlled Grammars, Erasing in Petri Net Languages and Matrix Grammars, Convex and anti-convex languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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