Simulating cellular automata by infinite Petri nets

MaRDI QIDQ5010295zbMATH OpenFDO

Authors Dmitry A. Zaitsev

Publication date 25 August 2021

Full work available at URL http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-13-number-1-2-2018/jca-13-1-2-p-121-144/

zbMATH Keywords

cellular automatacomplexityinfinite Petri netsimulationTuring machineuniversal Petri net

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Universality in infinite Petri nets
• Petri net implementations by a universal cell space
• scientific article; zbMATH DE number 7357525
• Catalytic and communicating Petri nets are Turing complete
• Infinite Petri nets. I. Modeling square grid structures

Cited in

(7)

• Superbinomial coefficients
• Catalytic Petri nets are Turing complete
• Universality in infinite Petri nets
• Catalytic and communicating Petri nets are Turing complete
• Infinite Petri nets. I. Modeling square grid structures
• Infinite Petri nets. II. Modeling triangular, hexagonal, hypercube and hypertorus structures
• Applications and Theory of Petri Nets 2004

This page was built for publication: Simulating cellular automata by infinite Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010295)