P and dp automata: unconventional versus classical automata

Authors:
Erzsébet Csuhaj-Varjú
Affiliations:
Department of Algorithms and Their Applications, Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 19
Cited 0

Finite-memory automata

Theoretical Computer Science
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
P Automata or Purely Communicating Accepting P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the computational complexity of membrane systems

Theoretical Computer Science
On the Computational Complexity of P Automata

Natural Computing: an international journal
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

Theoretical Computer Science
(Mem)brane automata

Theoretical Computer Science
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
On three classes of automata-like P systems

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
P finite automata and regular languages over countably infinite alphabets

WMC'06 Proceedings of the 7th international conference on Membrane Computing
P automata

WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the computational complexity of P automata

DNA'04 Proceedings of the 10th international conference on DNA computing
Brane calculi

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
P automata: concepts, results, and new aspects

WMC'09 Proceedings of the 10th international conference on Membrane Computing
An infinite hierarchy of languages defined by dP systems

Theoretical Computer Science
Finite dp automata versus multi-head finite automata

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss P automata and their distributed systems, called dP automata, constructs combining properties of classical automata and membrane systems being in interaction with their environments. We describe the most important variants and their properties, demonstrate their standard and non-standard features compared to characteristics of classical automata.