scientific article; zbMATH DE number 1738664
From MaRDI portal
Publication:4530001
Recommendations
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- Nonterminal complexity of programmed grammars.
- scientific article; zbMATH DE number 1738663
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- Nonterminal complexity of tree controlled grammars
Cited in
(35)- Membrane computing with transport and embedded proteins
- On three variants of rewriting P systems
- Nonterminal complexity of programmed grammars.
- Gemmating P systems: Collapsing hierarchies.
- Tissue P systems.
- Results on catalytic and evolution-communication P systems
- Tissue P systems with channel states
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Rewriting P systems: improved hierarchies
- A guide to membrane computing.
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Time-free cell-like P systems with multiple promoters/inhibitors
- Generalized forbidding matrix grammars and their membrane computing perspective
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P systems with mobile membranes
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- A general framework for regulated rewriting based on the applicability of rules
- Computability power of mobility in enhanced mobile membranes
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- On the Computational Power of Enhanced Mobile Membranes
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- The Expressiveness of Concentration Controlled P Systems
- scientific article; zbMATH DE number 1738663 (Why is no real title available?)
- scientific article; zbMATH DE number 1747441 (Why is no real title available?)
- P systems with active membranes: Trading time for space
- Enhanced mobile membranes: computability results
- (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power
- Improved descriptional complexity results on generalized forbidding grammars
- Investigations on the power of matrix insertion-deletion systems with small sizes
- On the computational completeness of generalized forbidding matrix grammars
- P systems with symport/antiport simulating counter automata
- Parsimonious computational completeness
- Universality results for P systems based on brane calculi operations
- Multiset random context grammars, checkers, and transducers
- Three ``quantum algorithms to solve 3-SAT
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530001)
