Ponencia
Red-Green P Automata
Autor/es | Aman, Bogdan
Csuhaj Varjú, Erzsébet Freund, Rudolf |
Fecha de publicación | 2014 |
Fecha de depósito | 2016-01-26 |
Publicado en |
|
ISBN/ISSN | 978-84-940056-4-0 |
Resumen | 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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
073_bwmc2014RedGreen.pdf | 64.64Kb | [PDF] | Ver/ | |