On the computational complexity of P automata (Q876857): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-005-4461-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094727449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with restricted memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of membrane systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of<i>P</i>automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of communication: P systems with symport/antiport / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:43, 25 June 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of P automata
scientific article

    Statements

    On the computational complexity of P automata (English)
    0 references
    0 references
    0 references
    19 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    accepting systems
    0 references
    communicating systems
    0 references
    automata
    0 references
    context-sensitive languages
    0 references
    sub-logarithmic space complexity
    0 references
    0 references