Watson-Crick T0L Systems and Red-Green Register Machines

E. Csuhaj-Varjú, Rudolf Freund, György Vaszil

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may "go beyond Turing" as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.

Original languageEnglish
Pages (from-to)111-129
Number of pages19
JournalFundamenta Informaticae
Volume155
Issue number1-2
DOIs
Publication statusPublished - Jan 1 2017

Fingerprint

Turing machines
Turing Machine
Turing
Trigger
Set of vectors
Natural number
Strings
Imply
Computing

Keywords

  • Complementary relation
  • Mind change
  • Red-green register machines
  • Red-green Turing machines
  • Watson-Crick T0L systems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Cite this

Watson-Crick T0L Systems and Red-Green Register Machines. / Csuhaj-Varjú, E.; Freund, Rudolf; Vaszil, György.

In: Fundamenta Informaticae, Vol. 155, No. 1-2, 01.01.2017, p. 111-129.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Freund, Rudolf ; Vaszil, György. / Watson-Crick T0L Systems and Red-Green Register Machines. In: Fundamenta Informaticae. 2017 ; Vol. 155, No. 1-2. pp. 111-129.
@article{65f0f80cec6b43e89b503a78228e4dce,
title = "Watson-Crick T0L Systems and Red-Green Register Machines",
abstract = "In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may {"}go beyond Turing{"} as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.",
keywords = "Complementary relation, Mind change, Red-green register machines, Red-green Turing machines, Watson-Crick T0L systems",
author = "E. Csuhaj-Varj{\'u} and Rudolf Freund and Gy{\"o}rgy Vaszil",
year = "2017",
month = "1",
day = "1",
doi = "10.3233/FI-2017-1578",
language = "English",
volume = "155",
pages = "111--129",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

TY - JOUR

T1 - Watson-Crick T0L Systems and Red-Green Register Machines

AU - Csuhaj-Varjú, E.

AU - Freund, Rudolf

AU - Vaszil, György

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may "go beyond Turing" as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.

AB - In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may "go beyond Turing" as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.

KW - Complementary relation

KW - Mind change

KW - Red-green register machines

KW - Red-green Turing machines

KW - Watson-Crick T0L systems

UR - http://www.scopus.com/inward/record.url?scp=85029518443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029518443&partnerID=8YFLogxK

U2 - 10.3233/FI-2017-1578

DO - 10.3233/FI-2017-1578

M3 - Article

VL - 155

SP - 111

EP - 129

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -