On the computational complexity of membrane systems (Q596128): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The chemical abstract machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tally languages and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with restricted memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally universal P systems without priorities: Two catalysts are sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems concerning semilinearity and commutation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note Concerning Nondeterministic Tape Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P systems with symport/Antiport rules: The traces of objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of communication: P systems with symport/antiport / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with membranes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane computing. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to membrane computing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on multihead automata and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707541 / rank
 
Normal rank

Latest revision as of 19:39, 6 June 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of membrane systems
scientific article

    Statements

    On the computational complexity of membrane systems (English)
    0 references
    0 references
    10 August 2004
    0 references
    0 references
    Membrane computing
    0 references
    Catalytic system
    0 references
    Communicating P system
    0 references
    Symport/antiport system
    0 references
    Space bounded
    0 references
    Time bounded
    0 references
    Reachability
    0 references
    Acceptor
    0 references
    Generator
    0 references
    Semilinear
    0 references
    0 references