A note on hybrid P systems

DOI10.1023/A:1022172312591zbMath1064.68047OpenAlexW1521297676MaRDI QIDQ1868519

Mutyam Madhu, Kamala Krithivasan

Publication date: 27 April 2003

Published in: Grammars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022172312591

zbMATH Keywords

recursively enumerable languagescontextual P systemshybrid P systemsKuroda normal formrewriting P systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (1)

Rewriting P systems: improved hierarchies

This page was built for publication: A note on hybrid P systems