Simplification of context-free grammar through Petri net

DOI10.1016/0045-7949(95)00209-YzbMath0898.68043OpenAlexW1977231885WikidataQ127808937 ScholiaQ127808937MaRDI QIDQ4379094

N. al-Shamlan, Ali Athar Khan, Mansoor Al-A'Ali

Publication date: 13 July 1998

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(95)00209-y

zbMATH Keywords

Petri netscontext-free grammar

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (4)

Generation of NOON states via Raman transitions in a bimodal cavity ⋮ Truncated coherent states and photon-addition ⋮ Approximate controllability, exact controllability, and conical eigenvalue intersections for quantum mechanical systems ⋮ Approximate controllability of the two trapped ions system

This page was built for publication: Simplification of context-free grammar through Petri net