An Algebraic Study on Automaton of Splicing System
نویسنده
چکیده
Madurai, (India) ABSTRACT In this paper we explore the finite automaton for n-cut splicing system. We propound a group structure for the automaton of splicing system. In addition, the product of automaton of splicing system with itself is scrutinized. It is found that the reconstructed machine from the product of automaton of splicing system is isomorphic to the automaton of splicing system. Hence, we show that any k th product of automaton of splicing system leads to the automaton of splicing system.
منابع مشابه
An automaton group: a computational case study
We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .
متن کاملRestoration of correct splicing in IVSI-110 mutation of β-globin gene with antisense oligonucleotides: implications and applications in functional assay development
Objective(s): The use of antisense oligonucleotides (AOs) to restore normal splicing by blocking the recognition of aberrant splice sites by the spliceosome represents an innovative means of potentially controlling certain inherited disorders affected by aberrant splicing. Selection of the appropriate target site is essential in the success of an AO therapy. In this study, in search for a splic...
متن کاملSOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملControlled Synthesis of Target Strings in a Class of Genetic Splicing Systems
This article presents an approach for synthesizing target strings in a class of computational models of DNA recombination. The computational models are formalized as splicing systems in the context of formal languages and automata. Given a splicing system, we construct a rule-embedded splicing automaton which implicitly contains not only the splicing language but also the rule sequences that ca...
متن کامل