P systems with minimal insertion and deletion

DOI10.1016/J.TCS.2010.08.025zbMATH Open1207.68180OpenAlexW2031654631MaRDI QIDQ616500FDOQ616500

Authors: Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan 

Publication date: 10 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/38817

Recommendations

• Context-free insertion-deletion systems
• Generating and accepting P systems with minimal left and right insertion and deletion
• About one-sided one-symbol insertion-deletion P systems
• Computational power of P systems with small size insertion and deletion rules
• Insertion-deletion systems with substitutions. I

zbMATH Keywords

membrane computingP systemsuniversalityinsertion-deletion systemsrecursively enumerable languages

Mathematics Subject Classification ID

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

Cites Work

• Context-free insertion-deletion systems
• Membrane computing. An introduction.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarks on blind and partially blind one-way multicounter machines
• Marcus contextual grammars
• Characterizations of recursively enumerable languages by means of insertion grammars
• On minimal context-free insertion-deletion systems
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Insertion-Deletion Systems with One-Sided Contexts
• Contextual insertions/deletions and computability
• DNA computing. New computing paradigms.
• Title not available (Why is that?)

Cited In (22)

• Generating and accepting P systems with minimal left and right insertion and deletion
• On path-controlled insertion-deletion systems
• Single semi-contextual insertion-deletion systems
• On Szilard languages of InsDel systems
• Computational power of insertion-deletion (P) systems with rules of size two
• Title not available (Why is that?)
• Generative power of matrix insertion-deletion systems with context-free insertion or deletion
• Adding matrix control: insertion-deletion systems with substitutions. III
• Investigations on the power of matrix insertion-deletion systems with small sizes
• On succinct description of certain context-free languages by ins-del and matrix ins-del systems
• On the generative capacity of matrix insertion-deletion systems of small sum-norm
• Context-free insertion-deletion systems
• Circular Post machines and P systems with exo-insertion and deletion
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
• On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
• On minimal context-free insertion-deletion systems
• Parallel contextual array insertion-deletion P systems and array rewriting P systems with pure 2D context-free rules
• Computational power of P systems with small size insertion and deletion rules
• Parallel contextual array insertion deletion P systems and tabled matrix grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptional complexity of graph-controlled insertion-deletion systems

This page was built for publication: P systems with minimal insertion and deletion

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