On Restricted Bio-Turing Machines

Authors:
Rama Raghavan;H. Ramesh;Marian Gheorghe;Shankara Narayanan Krishna
Affiliations:
(Correspd.) Department of Mathematics, Indian Institute of Technology Chennai, Chennai, India. ramar@iitm.ac.in;Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati, India. ramesh_h@iitg.ernet.in;Department of Computer Science, The University of Sheffield, Sheffield, UK. M.Gheorghe@dcs.shef.ac.uk;Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai, India. krishnas@iitb.ac.in
Venue:
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Year:
2011

Citing 11
Cited 0

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P Systems with replicated rewriting and stream X-machines (Eilenberg machines)

Fundamenta Informaticae - Membrane computing
The power of communication: P systems with symport/antiport

New Generation Computing
On membrane hierarchy in P systems

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
On determinism versus nondeterminism in P systems

Theoretical Computer Science
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
On the power of bio-turing machines

UC'06 Proceedings of the 5th international conference on Unconventional Computation
On bounded symport/antiport P systems

DNA'05 Proceedings of the 11th international conference on DNA Computing
On symport/antiport p systems and semilinear sets

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here we continue the study of bio-Turing machines introduced in [2] and further investigated in [17]. We introduce a restricted model of bio-Turing machine and we investigate its computational power, a hierarchy of languages accepted, and deterministic and nondeterministic variants. A comprehensive example illustrating the modelling power of the introduced machine ends the paper.