Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

Voted

MCU
2001

64views Hardware» more MCU 2001»

Two Normal Forms for Rewriting P Systems

15 years 4 months ago

Two Normal Forms for Rewriting P Systems

Download psystems.disco.unimib.it

Claudio Zandron, Claudio Ferretti, Giancarlo Mauri

Real-time Traffic

MCU 2001 | MCU 2007 |

claim paper

Related Content

» Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems

» When are Two Rewrite Systems More than None

» Decidability of Regularity and Related Properties of Ground Normal Form Languages

» Simulation as a Correct Transformation of Rewrite Systems

» Underspecified computation of normal forms

» A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite syste...

» Call by Need Computations to RootStable Form

» Normal Process Representatives

» Center bifurcation for TwoDimensional BorderCollision Normal Form

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	MCU
Authors	Claudio Zandron, Claudio Ferretti, Giancarlo Mauri

Comments (0)