Opened Access Red-Green P Automata
Cites
Show item statistics
Icon
Export to
Author: Aman, Bogdan
Csuhaj Varjú, Erzsébet
Freund, Rudolf
Date: 2014
Published in: Proceedings of the Twelfth Brainstorming Week on Membrane Computing, 73-78. Sevilla, E.T.S. de Ingeniería Informática, 3-7 de Febrero, 2014,
ISBN/ISSN: 978-84-940056-4-0
Document type: Presentation
Abstract: In this short note we extend the notion of red-green Turing machines to speci c variants of P automata. Acceptance and recognizability of nite strings by red- green automata are de ned via in nite runs of the automaton on the input string and the way how to distinguish between red and green states.
Size: 64.64Kb
Format: PDF

URI: http://hdl.handle.net/11441/33301

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)