On the computational complexity of P automata
type: Item
instance of: scholarly article
title: On the computational complexity of P automata
zbMATH Open document ID: 1112.68057
author: Erzsébet Csuhaj-Varjú
author: Oscar H. Ibarra
author: György Vaszil
published in: Natural Computing
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5144826
zbMATH Keywords: accepting systems
zbMATH Keywords: communicating systems
zbMATH Keywords: automata
zbMATH Keywords: context-sensitive languages
zbMATH Keywords: sub-logarithmic space complexity
MaRDI profile type: Publication
full work available at URL: s11047-005-4461-1
OpenAlex ID: W2094727449
cites work: Turing machines with restricted memory access
cites work: Q4452070
cites work: On the computational complexity of membrane systems
cites work: On a class ofPautomata
cites work: The power of communication: P systems with symport/antiport
DOI: 10.1007/S11047-005-4461-1
Recommended article: DNA Computing
Recommended article: On the Power of P Automata
Recommended article: On the Computational Complexity of Partial Word Automata Problems
Recommended article: On a class ofPautomata
Recommended article: Q2769435
Recommended article: Complexity of some problems from the theory of automata
Recommended article: Q4902289
Recommended article: P Automata: Concepts, Results, and New Aspects
Recommended article: On computational complexity of set automata
description: scientific article; zbMATH DE number 5144826