István Katsányi  Home/Search
Context
Related
| ludens.elte.hu/~kacsa/pub...insdela.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ludens.elte.hu/~kacsa/pub...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the past few years several paper showed, that various generative mechanisms in formal language theory that used context-dependent insertions and deletions are capable of generating any recursively enumerable languages [1, 2, 3, 4, 5, 6, 7, 8, 9]. Since such systems are also models of molecular computing, for practical reasons it is important to examine these systems in a restricted case, in which the number of symbols in the model of the alphabet is limited. In [4] it is showed that we ... (Update)
Active bibliography (related documents): More All
3.5: A Note on Restricted Insertion-Deletion Systems - Katsányi (Correct)
0.5: From Micro-Soft to Bio-Soft: Computing with DNA - Kari (Correct)
0.3: Using DNA to solve the Bounded Post Correspondence Problem - Kari, Gloor, Yu (2000) (Correct)
Similar documents based on text: More All
0.3: Conference of Phd Students in Computer Science - Csendes (2000) (Correct)
0.1: Sets of Integers in Different Number Systems and the Chomsky.. - Katsanyi (Correct)
0.1: On Implementing Relational Databases on DNA Strands - Katsanyi (Correct)
BibTeX entry: (Update)
@misc{ nyi-restricted,
author = "István Katsányi",
title = "Restricted Insertion-Deletion Systems",
url = "citeseer.ist.psu.edu/632585.html" }
Citations (may not include all citations):220 Formal Languages (context) - Salomaa - 1973
164 Handbook of Formal Languages (context) - Rozenberg, Salomaa - 1997
13 On Insertion and Deletion in Formal Languages (context) - Kari - 1991
7 Semicontextual grammars (context) - Galiukschov - 1981
7 Information and Computation (context) - Kari, Thierrin et al. - 1996
5 One-sided and two-sided context in formal grammars (context) - Penttonen - 1974
5 the crossroads of DNA computing and formal languages: Charac.. (context) - Kari, un et al. - 1997
2 Characterizations of recursively enumerable languages by mea.. (context) - Martin-Vide, un et al. - 1998
2 New Computing Paradigms (context) - un, Rozenberg et al. - 1998
2 the computational power of insertiondeletion systems (context) - Takahara, Yokomori - 2002
2 crowd: Set-conditional string processing (context) - Margenstern, un et al. - 2002
2 Context-free insertion-deletion systems (context) - Margenstern, un et al. - 2003
2 Circular contextual insertiondeletion with application to bi.. - Lila, Gloor et al. - 1999
Documents on the same site (http://ludens.elte.hu/~kacsa/publ/index.html): More
Solutions of some Classical Problems in Various Theoretical DNA.. - Katsanyi (Correct)
Sets of Integers in Different Number Systems and the Chomsky.. - Katsanyi (Correct)
Molecular Computing Solutions of Some Classical Problems - Katsanyi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC