On a class ofPautomata

From MaRDI portal

Revision as of 05:05, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4460604

Jump to:navigation, search

DOI10.1080/0020716031000148502zbMath1091.68067OpenAlexW2153990742MaRDI QIDQ4460604

Mutyam Madhu, Kamala Krithivasan

Publication date: 18 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000148502

zbMATH Keywords

P systems recursively enumerable languages Parikh mapping matrix grammar

Mathematics Subject Classification ID

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

Related Items (3)

On the computational complexity of P automata ⋮ P transducers ⋮ Membrane automata for modeling biomolecular processes

This page was built for publication: On a class ofPautomata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4460604&oldid=18516555"