On a class ofPautomata

DOI10.1080/0020716031000148502MaRDI QIDQ4460604zbMATH OpenOpenAlexFDO

Authors 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 systemsrecursively enumerable languagesParikh mappingmatrix grammar

Mathematics Subject Classification ID

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

Recommendations

• On the power of P automata
• Membrane Computing
• On languages of P automata
• DNA Computing
• On the computational complexity of P automata
• P automata: concepts, results, and new aspects
• P automata revisited
• scientific article; zbMATH DE number 2040914
• ON STATELESS AUTOMATA AND P SYSTEMS
• On the power of P and dP automata

Cited in

(17)

• DNA Computing
• On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
• scientific article; zbMATH DE number 3860401 (Why is no real title available?)
• A general approach for building combinationalPautomata
• On languages of P automata
• Membrane Computing
• Membrane Computing
• ON STATELESS AUTOMATA AND P SYSTEMS
• On the computational complexity of P automata
• scientific article; zbMATH DE number 2040914 (Why is no real title available?)
• Membrane automata for modeling biomolecular processes
• Red–Green P Automata
• P transducers
• scientific article; zbMATH DE number 6515829 (Why is no real title available?)
• A class of semisimple automata
• Chocolate P automata
• P automata with restricted power

This page was built for publication: On a class ofPautomata

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