Formal Languages Theory of Codes Combinatorics on words Molecular Computing.

Slides:



Advertisements
Similar presentations
DNA and splicing (circular) Dipartimento di Informatica Sistemistica e Comunicazioni, Univ. di Milano - Bicocca ITALY Dipartimento di Informatica e Applicazioni,
Advertisements

Ravello settembre 2003Covering Problems from a Formal Language Point of View M. Anselmo - M. Madonia 1 Covering problems from a formal language point.
Molecular Computing Formal Languages Theory of Codes Combinatorics on Words.
Slide 1 Insert your own content. Slide 2 Insert your own content.
REQ Drop from Demand Response Programs Process Flow Retail Customer Demand Response Service Provider (DRSP) Distribution Company 1 Drop Request.
Source of slides: Introduction to Automata Theory, Languages and Computation.
By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman
0 - 0.
ALGEBRAIC EXPRESSIONS
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
Addition Facts
Specifying Languages Our aim is to be able to specify languages for use in the computer. The sketch of the FSA is easy for us to understand, but difficult.
Specifying Languages Our aim is to be able to specify languages for use in the computer. The sketch of an FSA is easy for us to understand, but difficult.
Dr. Alexandra I. Cristea CS 319: Theory of Databases.
Towards a characterization of regular languages generated by finite splicing systems: where are we? Ravello, Settembre 2003 Paola Bonizzoni, Giancarlo.
Measuring Time Complexity
O X Click on Number next to person for a question.
How to convert a left linear grammar to a right linear grammar
Points on a Line Topic
Formal Languages: main findings so far A problem can be formalised as a formal language A formal language can be defined in various ways, e.g.: the language.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Limits (Algebraic) Calculus Fall, What can we do with limits?
Kleene's Theorem We have defined the regular languages, using regular expressions, which are convenient to write down and use. We have also defined the.
Properties of Exponents
Addition 1’s to 20.
Test B, 100 Subtraction Facts
Conjunctive Grammars and Alternating Automata Tamar Aizikowitz and Michael Kaminski Technion – Israel Institute of Technology WoLLIC 2008 Heriot-Watt University.
Week 1.
O X Click on Number next to person for a question.
Language and Automata Theory
Class 4 – Some applications of revenue equivalence
David Evans cs302: Theory of Computation University of Virginia Computer Science Lecture 13: Turing Machines.
Natural Language Processing - Formal Language - (formal) Language (formal) Grammar.
1 Introduction to Computability Theory Lecture12: Decidable Languages Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture5: Context Free Languages Prof. Amos Israeli.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 4 Context-free grammars Jan Maluszynski, IDA, 2007
CS 310 – Fall 2006 Pacific University CS310 Strings, String Operators, and Languages Sections: August 30, 2006.
79 Regular Expression Regular expressions over an alphabet  are defined recursively as follows. (1) Ø, which denotes the empty set, is a regular expression.
CS5371 Theory of Computation Lecture 4: Automata Theory II (DFA = NFA, Regular Language)
Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.
DNA SPLICING RULES STAYING TRUE TO THE BIOLOGY Elizabeth Goode April 2015.
1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of the field 5Splicing systems.
“Developments on linear and circular splicing” Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza Dipartimento di Informatica Sistemistica.
On the intersection of submonoids of the free monoid L. Giambruno A. Restivo.
Introduction to CS Theory Lecture 3 – Regular Languages Piotr Faliszewski
1 Language Definitions Lecture # 2. Defining Languages The languages can be defined in different ways, such as Descriptive definition, Recursive definition,
1 INFO 2950 Prof. Carla Gomes Module Modeling Computation: Language Recognition Rosen, Chapter 12.4.
Grammars CPSC 5135.
1 Introduction to Regular Expressions EELS Meeting, Dec Tom Horton Dept. of Computer Science Univ. of Virginia
Moore automata and epichristoffel words
Computing languages by (bounded) local sets Dora Giammarresi Università di Roma “Tor Vergata” Italy.
“New results on finite H-systems” Budapest, 29/30 November 2002 Jointly with Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri Dipartimento di Informatica.
Specifying Languages Our aim is to be able to specify languages for use in the computer. The sketch of an FSA is easy for us to understand, but difficult.
ON THE EXPRESSIVE POWER OF SHUFFLE PRODUCT Antonio Restivo Università di Palermo.
CSC312 Automata Theory Lecture # 26 Chapter # 12 by Cohen Context Free Grammars.
Regular Grammars Reading: 3.3. What we know so far…  FSA = Regular Language  Regular Expression describes a Regular Language  Every Regular Language.
1 Language Recognition (11.4) Longin Jan Latecki Temple University Based on slides by Costas Busch from the courseCostas Busch
Topic 3: Automata Theory 1. OutlineOutline Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.
Implementation of Haskell Modules for Automata and Sticker Systems
Formal Methods in software development
Formal Language & Automata Theory
Complexity and Computability Theory I
Natural Language Processing - Formal Language -
Context Sensitive Grammar & Turing Machines
Formal Language Theory
CSE322 Chomsky classification
Regular Grammar.
Dipartimento di Informatica e Applicazioni, Univ. of Salerno, ITALY
Formal Methods in software development
Presentation transcript:

Formal Languages Theory of Codes Combinatorics on words Molecular Computing

Formal Languages Molecular Computing Theory of Codes Combinatorics on words THESIS On the power of classes of splicing systems Dottoranda: Rosalba Zizza (XIII ciclo) Supervisori: Prof. Giancarlo Mauri Prof.ssa Clelia De Felice (Univ. di Salerno)

Formal Language Theory and DNA : an analysis of the generative capacity of specific recombinant behaviors SPLICING Modelli non convenzionali di calcolo Tom Head 1987 (Bull. of Math. Biology) LINEARE CIRCOLARE

Una motivazione generale per lo splicing Gearchia di Chomsky Splicing systems REmT CSLBA CFPDA REGDFA F 1, F 2 {FIN, RE, CS, CF,REG} H(F 1, F 2 ) ; C(F 1, F 2 ) 1) Processo generativo del linguaggio 2) Prove di consistenza del sistema splicing

LINEAR SPLICING restriction enzyme 1 ligase enzyme restriction enzyme 2

Pauns definition Linear splicing systems (A= finite alphabet, I A * initial language) S PA = (A, I, R) R A* | A* $ A* | A* rules x u 1 u 2 y,wu3u4 zwu3u4 z A * r = u 1 | u 2 $ u 3 | u 4 R x u 1, u 2 ywu 3, u 4 zx u 1 u 4 z, wu 3 u 2 y Definitions Splicing language L(S PA ), H(F1, F2) Some known results Some known results [Head; Paun; Pixton; 1996-] Fin H(Fin, Fin) Reg Fin H(Fin, Reg) Re H(Reg, Fin) = Reg

Problem (HEAD) Can we decide whether a regular language is generated by a finite splicing system? [P. Bonizzoni, R.Z., Tech Rep DSI, submitted] L(S H ) L(S PA ) L(S PI ) [P. Bonizzoni, C. Ferretti, G. Mauri, R.Z., Grammar Systems 2000, IPL 01] Comparing the three definitions of (finite) splicing

Theorem L regular language 0-generated L generated by finite splicing Monoide sintattico: Rappresentazione di L attraverso classi di congruenza Proprieta delle classi di congruenza... regole splicing

CIRCULAR SPLICING restriction enzyme 1 restriction enzyme 2 ligase enzyme

Circular languages: definitions and examples Conjugacy relation on A* w, w A*, w ~ w w=xy, w = yx Example abaa, baaa, aaab,aaba are conjugate A ~ = A* ~ = set of all circular words ~ w = [w] ~, w A* Circular language C A ~ set of equivalence classes A* A* ~ L ~ L = { ~ w | w L} (circularization of L) CL C {w A*| ~ w C}= Lin(C) (Full linearization of C) (A linearization of C, i.e. ~ L =C)

Il nostro approccio... Linguaggi Circolari Linguaggi Formali chiusi sotto coniugazione Regolari

Pauns definition Circular splicing systems (A= finite alphabet, I A ~ initial language) SC PA = (A, I, R) R A* | A* $ A* | A* rules ~hu1u2,~hu1u2, ~ku3u4~ku3u4 A ~ r = u 1 | u 2 $ u 3 | u 4 R u 2 hu 1 u4ku3u4ku3 ~ u 2 hu 1 u 4 ku 3 Definition In the literature... Other models, additional hypothesis (on R) Other definitions of circular splicing (Head, Pixton) Splicing language C(SC PA )

Problem 1 Problem 2 Characterize circular regular languages generated by finite circular splicing Structure of circular regular languages (regular languages closed under conjugacy relation)

Circular finite splicing languages and Chomsky hierarchy CS ~ CF ~ Reg ~ ~ ((aa)*b) ~ (aa)* ~ (a n b n ) I= ~ aa ~ 1, R={aa | 1 $ 1 | aa} I= ~ ab ~ 1, R={a | b $ b | a}

Contributions Reg ~ Fingerprint closed star languages X*, X regular group code Cir (X*) X finite cyclic languages weak cyclic, altri esempi ~ (a*ba*)* [P. Bonizzoni, C. De Felice, G. Mauri, R.Z., Words99, DNA6 (2000), submitted] -Reg ~ C(Fin, Fin) -Comparing the three def. of circular splicing systems C(SC H ) C(SC PA ) C(SC PI )

Consistence easily follows!!! then the circular language generated by SC PA is ~ X* The unique problem is the generation of all words of the language L A* star language = L regular, closed under conjugacy relation, L=X*, with X regular Proposition Why studying star languages? Given SC PA = (A,I,R), if I ~ X*, ~ X* star language

Proposition Theorem X* star language AND fingerprint closed ~ X* generated (by splicing) X regular group code. For any automaton A and for any cycle c in A, c X*. (X* is fingerprint closed) X* star language, X finite set ~ X* generated (by splicing)

The case of one-letter alphabet Each language on a* is closed under conjugacy relation Theorem L a* is CPA generatedL = L 1 (a G ) + L 1 is a finite set n : G is a set of representatives of the elements in a subgroup G of Z n max{ m | a m L 1 } < n = min{ a g | a g G } = min a G Uniform languages characterization J N, L = A J = j J A j = {w A * | |w|=j}

Complexity description / minimal splicing system Theorem L a* generated by a finite circular (Paun) system, then L is generated by ({a}, I, R) with I = L 1 a G R= { a n | 1 $ 1 | a n } Examples L = { a 3, a 4 } { a 6, a 14, a 16 } + I={} R={ } I={a 3, a 4, a 6, a 14, a 16 } R={ a 6 | 1 $ 1 | a 6 } L = { a 3, a 4, a 5, a 7 } {a 8, a 9, a 10, a 12, a 13, a 14, a 15 } + I={} R={ } I={a 3, a 4, a 5, a 7, a 8, a 9, a 10, a 12, a 13, a 14, a 15 } R={ a 8 | 1 $ 1 | a 8 }

Given L a*, we CAN NOT DECIDE whether L is generated by a circular (Paun) splicing system (Rices theorem) Problem: Problem: Given L a*, regular, can we decide whether L is generated by a circular (Paun) splicing system? Probably YES !!!

L = { a 3, a 4 } { a 6, a 14, a 16 } + Sketch: G = {0, 2, 4} subgroup of Z 6 |F l |=1, F l ={q n } p | n : n p { a 3, a 4, a 6 } a 11 a 12 G ={6, 14, 16 }

Computational power of Pixtons systems Computational power of Pixtons systems SC PI = (A, I, R) A ~ (, ; ), (, ; ) R ~ h h ~ h, ~ h h Pixtons definition R A* A* A* rules h C(SC H ) C(SC PA ) C(SC PI ) ~ Reg Remind Pixton recombinant process ~ ((A 2 )* (A 3 )*) ~ Reg \ C(SC PI )

F Class of circular regular languages generated by Pixton X* generated by regular group codes F All known examples of regular splicing languages F ~ A* \ a+ = ~ (a*ba*)* (star free language) ~ (aa)*b ~ {w A* | h,k N : |w| a =2h+1, |w| b =2k+1} ~ (aa)*a, ~ (ab)*a ~ (ab)*b

(Linear splicing) Inclusion results (Circular splicing) Characterization of regular (finite) splicing languages Fingerprint closed star languages, cyclic languages, weak cyclic languages, unary languages (CODES) Pixton systems (subclasses or regular languages) (Linear splicing) Problems on descriptional complexity (Formal languages) Characterization of circular regular languages Unary Languages: linear splicing vs. circular splicing (Circular splicing) Pixton systems