Minimizing evolution communication P systems and automata

DOI10.1007/BF03037283MaRDI QIDQ1762935zbMATH OpenFDO

Authors Artiom Alhazov

Publication date 11 February 2005

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

Membrane ComputingEC P AutomataEC P SystemsTuring Computability

Mathematics Subject Classification ID

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

Recommendations

• P systems with evolutional communication and separation rules
• scientific article; zbMATH DE number 1951580
• On generalized communicating P systems with minimal interaction rules
• On evolution-communication P systems with energy having bounded and unbounded communication
• scientific article; zbMATH DE number 2050931
• Relating computations in non-cooperative transition P systems and evolution-communication P systems with energy
• Membrane Computing
• Measuring communication in automata systems (invited paper)
• Results on catalytic and evolution-communication P systems

Cited in

(10)

• A survey of results on evolution-communication P systems with energy
• A multiset-based model of synchronizing agents: Computability and robustness
• On evolution-communication P systems with energy having bounded and unbounded communication
• FURTHER RESULTS ON TIME-FREE P SYSTEMS
• Results on catalytic and evolution-communication P systems
• Properties of membrane systems
• Relating computations in non-cooperative transition P systems and evolution-communication P systems with energy
• On simulating cooperative transition P systems in evolution-communication P systems with energy
• Look-ahead evolution for P systems
• scientific article; zbMATH DE number 1951580 (Why is no real title available?)

This page was built for publication: Minimizing evolution communication P systems and automata

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