On determinism versus nondeterminism in P systems (Q2575077): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074125075 / 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: Membrane Computing / 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: The power of communication: P systems with symport/antiport / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to 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

Latest revision as of 12:40, 11 June 2024

scientific article
Language Label Description Also known as
English
On determinism versus nondeterminism in P systems
scientific article

    Statements

    On determinism versus nondeterminism in P systems (English)
    0 references
    0 references
    5 December 2005
    0 references
    determinism versus nondeterminism
    0 references
    molecular computing
    0 references
    P system
    0 references
    communicating P systems
    0 references
    counter machine
    0 references
    two-way multihead finite automaton
    0 references

    Identifiers