Nine Test Tubes Generate any RE Language. C. Ferretti, G. Mauri, C. Zandron. Universita di Milano - ITALY. Abstract
|
|
- Joshua Bradford
- 5 years ago
- Views:
Transcription
1 Nine Test Tubes Generate any RE Language C. Ferretti, G. Mauri, C. Zandron Dipartimento di Scienze dell'informazione via Comelico 39, Milano Universita di Milano - ITALY Abstract In this paper we prove that any recursively enumerable language can be generated using a distributed splicing system with a xed number of test tubes. This improves a recent result by Csuhaj-Varju, Kari, Paun, proving computational completeness only for a system with a number of tubes depending on the cardinality of the used alphabet. 1 Introduction The family of recursively enumerable languages, RE for short, marks in the usual Chomsky hierarchy for formal languages the computational power equal to that of Turing machines. That's why this family is a benchmark for studying the computational power of new models for formal languages and/or for computation itself. This is the case with the models of DNA computation recently brought to attention [1,2] as an alternative machinery to the usual silicon based computers. To compare these models to RE we rst need to map them to a suitable formal language system.one formal model apt to this domain was already suggested in 1987 by Head [4]. It is called splicing system model, and it describes one specic DNA transformation, the one operated by restriction enzymes. They cut DNA sequences at the occurrence of specic subsequences, and the thus created halves can successively rejoin with others to create new complete molecules. The model we consider here has been dened through a few modications of the original splicing model. As we will see when giving the formal denitions, it considers a set of terminals, as the original model, but also a set of nonterminals. Also, it considers the strings-molecules interacting in groups assigned to dierent test tubes, and to be from time to time redistributed among the dierent tubes according to ltering rules, as dened in [3]. So we have a system generating to ferretti@dsi.unimi.it. This work has been supported by the Italian Ministry of University (MURST), under project 40% \Algorithms and Information Structures", and by the National Research Council. 1
2 strings by interactions at two levels: inside the tubes among strings, and among the tubes in the redistribution of the sets of strings. This paper improves a result given in a preceding paper [5], where it was proved how to reach the power of RE with a xed number of test tubes, instead of a number dependent on the number of symbols contained in the alphabet as was in [3]. In [5], the number of necessary tubes was 10, while here we show that nine tubes suce. We do this by designing a kind of simple encoding/decoding sub-procedure based only on splicing. This result opens way to considerations related to the practical feasibility of this model for DNA computations and, perhaps even more important, to the eectiveness of new general purpose algorithms natively dened for splicing systems. We will diuse on these issues in the closing section of the paper. 2 Basic Denitions As usual, V is the set of all (nite length) strings over a nite alphabet V. The empty string is denoted by. The families of recursively enumerable languages and nite languages are denoted by RE and F IN, respectively. We now introduce the denitions of splicing system, and of distributed splicing system. A Head splicing system (or H system) is a triple H = (V; A; R), where V is the alphabet of H, A V is the set of axioms, and R is the set of splicing rules, with R V #V $V #V ($; # are special symbols not in V ). For x; y; z; w 2 V and r = u 1 #u 2 $u 3 #u 4 in R, we dene (x, y) `r (z, w) if and only if x = x 1 u 1 u 2 x 2, y = y 1 u 3 u 4 y 2, and z = x 1 u 1 u 4 y 2, w = y 1 u 3 u 2 x 2, for some x 1 ; x 2 ; y 1 ; y 2 2 V. For a H system H = (V; A; R) and a language L V, we write (L) = fz 2 V j(x; y) `r (z; w) or (x; y) `r (w; z); for some x; y 2 L; r 2 Rg; and dene (L) = [ i0 i (L) where 0 (L) = L i+1 (L) = i (L) [ ( i (L)) for i 0: A H system is meant to operate starting from the set of strings A, and then generate new strings iterating the splicing step `r on, them and on the strings generated during this process. The language generated in this way is (A). 2
3 A test tube system, T T for short, is a construct? = (V; (A 1 ; R 1 ; V 1 ); : : : ; (A n ; R n ; V n )) where each A i V ; R i V #V $V #V, and V i V, for 1 i n. V i is called the selector of tube i. Each triple (A i ; R i ; V i ), also called tube, operates individually in the same way as a H system (V; A i ; R i ). According to the denition of H systems, they would generate the language denoted by i (A i), but we will see that in a TT they interact among them, accepting from the others the strings belonging to V i. The set B of strings outside any language V is dened as follows B = V? Each tube i in the system starts containing only the strings of A i. One processing step (`)') of the system, moves it from the conguration (L 1 ; : : : ; L n ), where each tube i contains the strings of L i, to a conguration (L 0 1 ; : : : ; L0 n ), according to the following denition (L 1 ; : : : ; L n ) ) (L 0 1 ; : : :; L0 ) i n n[? L 0 i = [ j (L j ) \ V i ( i (L i ) \ B)) j=1 n[ i=1 V i for each i; 1 i n Finally, we state that the language generated by a T T? is the set of words appearing in the tube 1 at any processing step, when starting from the conguration (A 1 ; : : :; A n ): () is the reexive and transitive closure of the relation )) L(?) = fw 2 V jw 2 L 1 for some (A 1 ; : : : ; A n ) ) (L 1 ; : : : ; L n )g T T n (F 1 ; F 2 ) = fl(?)g such that? is a splicing system with at most n tubes, each with set of axioms from F 1 and set of rules from F 2. The set of languages generated using any number of tubes is dened by T T (F 1 ; F 2 ) = [ n1 T T n (F 1 ; F 2 ) i 3 Test Tube Systems and RE Languages In this section we prove in details our main result. Theorem 1 T T 9 (F IN; F IN) = T T (F IN; F IN) = T T (F 1 ; F 2 ) = RE for all families F 1 ; F 2 such that REG F i RE; i = 1; 2. 3
4 Proof. The inclusions T T 9 (F IN; F IN) T T (F IN; F IN) T T (F 1 ; F 2 ) are obvious. The inclusion T T 9 (F IN; F IN) RE is obvious from the Turing/Church thesis. Hence, it is sucient to prove that RE T T 9 (F IN; F IN). Take a type-0 Chomsky grammar G = (N; T; S; P ). Denote U = N [ T and construct the Test Tubes System? = (V; (A 1 ; R 1 ; V 1 ); (A 2 ; R 2 ; V 2 ); (A 3 ; R 3 ; V 3 ); (A 4 ; R 4 ; V 4 ); (A 5 ; R 5 ; V 5 ); (A 6 ; R 6 ; V 6 ); (A 7 ; R 7 ; V 7 ); (A 8 ; R 8 ; V 8 ); (A 9 ; R 9 ; V 9 )) with V = N [ T [ fx; X 0 ; Y; Y 0 ; Z; Z 0 ; H; H 0 ; R; K; g: Denote with U 1 ; : : : ; U n the symbols of the alphabet U (i.e. non terminal and terminal symbols of G) and with U n+1 the special symbol B. Dene A 1 = ; R 1 = ; V 1 = T A 2 = fxbsy; Z 0 Zg [ fzvy ju! v 2 P g [ fz@ i Y 0 j1 i n + 1g R 2 = f#uy $Z#vY ju! v 2 P g [ f#u i Y $Z#@ i Y 0 ju i 2 U [ fbgg [fz 0 #Z$XB#g V 2 = U [ fb; X; Y g A 3 = ; HH 0 g R 3 = f#@y 0 g [ f#y 0 $H#H 0 j 2 U [ fbgg V 3 = U [ fx; Y 0 g A 4 = fx R 4 = fx#$x V 4 = U [ fx; g A 5 = fzy 0 g R 5 = $Z#Y 0 g V 5 = U [ fx 0 ; g A 6 = fxzg R 6 = fx 0 #$X#Zg V 6 = U [ fx 0 ; B; Y 0 4
5 A 7 = fxu i Kj1 i n + 1g [ fry g R 7 = fx@ i #$XU i #Kj 2 U [ fbgg [ f#h 0 $R#Y g V 7 = U [ fx; H 0 g A 8 = fzzg R 8 = f#y $ZZ#g V 8 = T [ fy; Z 0 g A 9 = fzzg R 9 = f#zz$z 0 #g V 9 = T [ fz 0 g Let us examine the work of?. The rst component only selects the string produced by the others components that are terminal according to G. No such terminal string can enter a splicing, because all rules involves at least one special symbol that we add to the set of terminal and non terminal symbols. In tube 2 applications of productions of the form u! v 2 P to sentential forms Xw 1 Bw 2 uy are simulated, where w 2 uw 1 is a sentential form of G, and X; Y; B are special symbols, indicating respectively the left end and the right end of the sentential form in? and the beginning of the rotating string representing the corresponding sentential form in G. Tubes 3, 4, 5, 6 and 7 are used to rotate the symbols, so we can simulate the productions of G in the correct place. Tubes 8 and 9 are used to eliminate special symbols X and Y, so we obtain a terminal string. The construction works as follows: in the initial conguration (A 1 ; : : : ; A 9 ), only the second component can execute a splicing. There are three possibilities. We can either use a rule of the form #uy $Z#vY, for u! v 2 P (we call this a splicing of type 1), or 1a rule of the form #U i Y $Z#@ i Y 0 where U i is the i-th symbol of the alphabet U or, if i = n + 1, the symbol B (splicing of type 2), or the rule Z 0 #Z$XB# (splicing of type 3). In the following, while describing these three cases we will also denote them by `n, with n = 1; 2; 3. Consider the general case of having in tube 2 a string XwY, with w 2 U BU ; initially, w = BS. We have three possibilities for splicing: 1. (Xw 1 juy; ZjvY ) `1 (Xw 1 vy; ZuY ) for u! v 2 P and w = w1u 2. (Xw 1 ju i Y; Zj@ i Y 0 ) `2 (Xw i Y 0 ; ZU i Y ) for U i 2 U [fbg and w = w i U i 3. (Z 0 jz; XBjw 1 Y ) `3 (Z 0 w 1 Y; XBZ) for w = Bw 1 Let's examine the strings we've just created. 5
6 The string Xw 1 vy will remain in tube 2, entering new splicing of one of the three types. Clearly, the passage from Xw 1 uy to Xw 1 vy corresponds to using the rule u! v 2 P on a sux on the string bracketed by X; Y. The string ZuY will remain in tube 2, too. Such a string can enter a splicing in three cases 1. ZuY is an Axiom, then nothing new appears. 2. ZuY is used as the rst term of s splicing of the form (Zu 1 ju 0 ; Zv 0 Y ) `1 (Zu 1 v 0 Y; Zu 0 Y ), for u = u 1 u 0 and u 0! v 0 2 P ; we obtain two strings of the same form, zxy, which will remain in tube ZuY is used as the rst term in a splicing of the form (Zu 1 ju i Y; Zj@ i Y 0 ) `2 (Zu i Y 0 ; ZU i Y ), for u = u 1 U i ; U i 2 U [ fbg; the string zu i Y 0 cannot enter new splicing and cannot be transmitted to another tube. After any sequence of such splicings, the obtained strings still will be of the form ZxY, hence they will remain in tube 2 and will enter other \legal" splicing, when they are axioms, or they will enter splicing producing \useless" strings ZyY. Therefore, after a series of splicings of type 1, eventually in tube 2 a splicing of type 2 will be performed, producing strings of the form Xw i Y 0 and ZU i Y. The second string behaves exactly as we discussed above for the string ZuY. If a string Xw i Y 0 enters a new splicing in tube 2 this can only be splicing of type 3, (Z 0 jz; XBjw i Y 0 ) `3 (Z 0 w 0 ; XBZ) for w 1 = Bw 2. The string Z 0 w i Y 0 cannot enter new splicing in tube 2 and cannot be transmitted to another tube. If the string XBZ enters new splicing, this can only be of type 3, (Z 0 jz; XBjZ) `3 (Z 0 Z; XBZ) so nothing new can be created. Any string Xw i Y 0 is moved from tube 2 to tube 3 where we have to perform (Xw i?1 j@y 0 ; ) ` (Xw + 1@ i?1 ; Z@Y 0 ): The second type of rule of tube 3 will be examined below. The string Z@Y 0 cannot be transmitted to another tube and can enter only splicing of the form (Zj@Y 0 ; ) ` (Z@Y 0 ; ) hence creating nothing new. The string Xw i?1 cannot enter new splicing in tube 3, it will be transmitted to tube 4 where we have to perform (Xjw i?1 ; X ` (X i?1 ; XZ) The string XZ cannot be transmitted to another tube and can enter only splicing of the form (XjZ; X ` (XZ; X 6
7 hence creating nothing new. The string X i?1 1 cannot enter new splicing in this tube; it will be transmitted to tube 5, where the only possible splicing is (X i?1 ; ZjY 0 ) ` (X i?1 Y 0 ; ) The string cannot be transmitted to another tube and can enter only splicing of the form ; ZjY 0 ) ` ; ZY 0 ) so it can create nothing new. The string X i?1 Y 0 cannot enter new splicing in this tube; it will be transmitted to tube 6. In tube 6 we can only execute (X 0 j@w i?1 Y 0 ; XjZ 0 ) ` (X@w i?1 Y 0 ; X 0 Z 0 ) The string X 0 Z 0 cannot be transmitted to another tube and can only enter splicing of the form (X 0 jz 0 ; XjZ 0 ) ` (X 0 Z 0 ; XZ 0 ) hence producing nothing new. The string X@w i?1 Y 0 cannot enter a new splicing in this tube; it will be moved to tube 3. We started from tube 3 with the string Xw i Y 0 and now we returned to tube 3 with the string X@w i?1 Y 0. A from the right end of the string bracketed by X; Y 0 has been moved to the left end. The string X@w i?1 Y 0 cannot enter splicing of the second type in tube 3, but can enter splicing of the rst type in tube 3. By repeating the operations just described, we will return to tube 3 with the string X@@w i?2 Y 0 (i.e. we will rotate another This sequence will be repeated until all will be moved from the right end to the left end of the string bracketed by X; Y 0. It will take i steps. Then, in tube 3 we obtain a string of the form X@ i w 1 Y 0. This string cannot enter splicing of rst type in tube 3, but it can enter splicing of second type in this tube, so we can perform (X@ i w 2 jy 0 ; HjH 0 ) ` (X@ i w 2 H 0 ; HY 0 ); for w 1 = w 2 ; 2 U [ fbg: The string HY 0 cannot be transmitted to other tubes, and can only enter splicing of the form (HjY 0 ; HjH 0 ) ` (XY 0 ; HH 0 ) hence creating nothing new. The string X@ i w 1 H 0 cannot enter new splicing in this tube; it will be transmitted to tube 7. In tube 7 we have to perform one of two possible splicings. With the rst operation (X@ i jw 3 H 0 ; XU i jk) ` (XU i w 3 H 0 ; X@ i K); for w 1 = w 3 ; 2 U [ fbg: 7
8 we decode the symbol U i i (we coded U i i with the splicing of type 2 in tube 2). The string X@ i K cannot be transmitted to another tube, but it could enter the second kind of splicing in this tube, becoming X@ i Y. But this is refused by any other tube, especially tube 2 where X and Y are admitted, but The string XU i w 1 H 0 the second kind of splicing in this tube. We have to perform (XU i w 4 jh 0 ; RjY ) ` (XU i w 4 Y; RH 0 ) The string RH 0 can only become again RY, so it can't create nothing new. The string XU i w 1 Y cannot enter new splicing in this tube. It will be moved to tube 2. After this sequence of operations, we can note that having started with the string Xw 1 U i Y in tube 2 we have returned to tube 2 with the string XU i w 1 Y. A symbol from the right end of the string bracketed by X; Y has been moved to the left end. In this way, the string bracketed by X; Y can enter circular permutations as long as we want them to do that. This allows us to pass from a string Xw 1 Bw 2 Y to any string Xw 0 1 Bw0 2 Y such that w 2w 1 = w 0 2 w0 1. In this way we can \rewind" the string until its sux is the left-hand member of any rule in P that we want to simulate by a rule in R 2 of the form #uy $#vy. As the symbol B is always present (and exactly one copy of it is present as long as we do not use the rule Z 0 #Z$XB# in R 2 ), in every moment we know where the \actual beginning" of the string is placed. Consequently, using splicing of type 1 and 2 in tube 2 and splicing of tubes 3, 4, 5, 6 and 7 as described above, we can simulate every derivation in G. Conversely, exactly strings of the form Xw 1 Bw 2 Y can be obtained in this way, they correspond to strings w 2 w 1 that are sentential forms of the grammar G. We have now to consider the splicing of type 3 in tube 2 and the tubes 8 and 9. We consider rst of all the splicing of type 3 in tube 2. We already viewed what happens for the strings XBZ and Xw@ i Y 0, so we have now to consider the strings of the form XBqY for q 2 U. Using a splicing of type three we have (Z 0 jz; XBjqY ) `3 (XBZ; Z 0 qy ): If a string Z 0 qy enter a splicing in tube 2 this can be of type 1 and 2 : (Z 0 q 1 juy; ZjvY ) `1 (Z 0 q 1 vy; ZuY ); for u! v 2 P; q = q 1 u (Z 0 q1ju i Y; Zj@ i Y 0 ) `2 (Z 0 q i Y 0 ; ZU i Y ); for U i 2 U [ fbg; q = q 1 U i We have already discussed the case of ZuY; ZU i Y and Z 0 q i Y 0. The string Z 0 q 1 vy can be obtained by performing rst (XBq 1 juy; ZjvY ) `1 (XBq 1 vy; ZuY ) and then (Z 0 jz; XBjq 1 vy ) `3 (Z 0 q 1 vy; XBZ); 8
9 so it is a \legal" string. If the string Z 0 qy, obtained with a splicing of type 3 in the tube 2, have the property that q 2 T (i.e. q is a terminal string) it can be moved to tube 8. Here the only possible splicing is (Z 0 qjy; ZZj) ` (Z 0 q; ZZY ): If ZZY will enter new splicing, these are of the forms (Z 0 xjy; ZZjY ) ` (Z 0 xy; ZZY ) (ZZjY; ZZjY ) ` (ZZY; ZZY ) hence no new string is obtained. The string Z 0 q cannot enter new splicing in tube 8. It will be moved to tube 9, where we have to perform (jzz; Z 0 jq) ` (q; Z 0 ZZ): If the string Z 0 ZZ enters new splicing, these are of the forms (Z 0 jzz; Z 0 jx) ` (Z 0 x; Z 0 ZZ) (Z 0 jzz; Z 0 jzz) ` (Z 0 ZZ; Z 0 ZZ) hence nothing new can be created. The string q is terminal. It will be transmitted to all tubes, including the rst one. No splicing can be done on a terminal string. As we seen above, such a terminal string q is a string in L(G). No parasitic string can reach the rst tube, consequently L(?) = L(G). 2 The basic ideas of the construction we present here are these: We simulate the productions of the grammar using splicing operations in Tube 2. Unfortunately, using the splicing operation, we can simulate a production (in one step) only if the sub-string we are going to substitute is placed at one end of the string. The splicing operation is not able to do such a substitution (using a nite number of rules) if the sub-string is placed in the internal part of the string. To deal with this problem, we use the rotation of the characters. Look at the Example 1 below: to simulate the production U! V we rotate the characters x 3 ; x 4 and x 5 so that we can move the sub-string U to the right end of the string. This position is optimal to simulate the production using a splicing operation. After that, we rotate the string V (one character at time),and then the character x 1 and x 2. Starting with x 1 x 2 U x 3 x 4 x 5 we obtain x 1 x 2 V x 3 x 4 x 5, so we have simulate properly the production U! V of the grammar. 9
10 Example 1: x 1 x 2 U x 3 x 4 x 5 ; x 5 x 1 x 2 U x 3 x 4 ; x 4 x 5 x 1 x 2 U x 3 ; x 3 x 4 x 5 x 1 x 2 U ; x 3 x 4 x 5 x 1 x 2 U ; x 3 x 4 x 5 x 1 x 2 V ; x 3 x 4 x 5 x 1 x 2 V ; V x 3 x 4 x 5 x 1 x 2 ; x 2 V x 3 x 4 x 5 x 1 ; x 1 x 2 V x 3 x 4 x 5 2 The rotation solves the problem we've just illustrated, but it introduces a new problem. When we rotate a character, we move it from one end to the other. Using splicing rules, this operation requires more than one step, so the problem we have to deal with, is how to delete the character from the right end of the string and to put the same character in the left end of the string. Due to the multi-step process, we could delete a character from the right end and put in the left end a dierent character, generating a word which the grammar was not able to create, even if we don't want to do so. In [3] the solution to this problem was to substitute the character to rotate with a symbol that contains the information on the character substituted and then to send the string obtained to a \special" tube that rotates that specic character. In the Example 2 we show how this can be done. Example 2: We consider the string x 1 x 2 x 3 x 4 x 5 w; the character w is replaced with Y w. x 1 x 2 x 3 x 4 x 5 w ; x 1 x 2 x 3 x 4 x 5 Y w Then, the string x 1 x 2 x 3 x 4 x 5 Y w is sent to the \special" tube, the only tube able to receive this string. This special tube is the only one that contain the character Y w in the lter, and its function is to rotate the specic character w. We are sure, in this case, to put in the left end of the string the same character we have deleted from the right end of the string. 2 The problem in this solution is that we need one of these \special" tubes for every character of the language we are going to generate (because we need one tube for every type of character to rotate). Thus, the number of test tubes needed to generate a language depends on the number of dierent characters used in the language we have to generate. In the model presented here, we introduce some dierences. First of all, we number the characters of the grammar. Before rotating a character, we encode it to a number of special not present in the alphabet of the grammar. The i-th character in the order we give, is substituted with i of this symbols. This operation is done by the splicing of type 2 in the second component test tube. Then the character is moved to the left end by rotating, one at a time, the special These rotations are executed by the component tubes 2, 3, 4, 5 and 6. 10
11 When all the special symbols have been rotated, we decode i special symbols with the correspondent character U i. This is done with the component 7. In the example below we illustrate these three main phases. Example 3: We show here the three main phases of the rotation of the character x 5 of the string x 1 x 2 x 3 x 4 x 5 : Encoding : x 1 x 2 x 3 x 4 x 5 ; x 1 x 2 x 3 x Rotation 1 x 2 x 3 x 1 x 2 x 3 x 1 x 2 x 3 x 1 x 2 x 3 x 1 x 2 x 3 x 4 Decoding 1 x 2 x 3 x 4 ; x 5 x 1 x 2 x 3 x 4 2 This solution oer three advantages: A character is coded when it is placed in the right end of the string, thus in a suitable place for the application of splicing rules. The only character that actually rotates is the special so we need just one of the \special" tubes used in [3], about which we have discussed before. A character is decoded when it is placed in the left end of the string, thus in a suitable place for the application of splicing rules. These advantages permit us to limit the number of tubes with respect to the construction presented in [3]. Using the construction we have explained, the number of tubes doesn't depend on the number of the characters of the language we have to generate: nine Test Tubes are enough to generate any RE language. 4 Conclusions and Perspectives We proved how to build a distributed splicing system powerful enough to generate any language in RE, and using a xed number of 9 test tubes, closing one open problem from [3]: the T T hierarchy is nite. There are other some consequences to this. The technique from [3] requires jt j + 8 test tubes for languages over T. One result for T T 7 made use of closure properties of the language classes being compared to T T 7, allowing to reduce the letters to two. We can extend here that result, described below, under two respects: we move it from T T 7 to T T 6, and we need no longer the property of closure under inverse morphisms. Theorem 2 For every family F such that F RE and F is closed under intersection with regular sets and restricted morphisms, we have T T 6 (F IN; F IN)? F 6= ; 11
12 Proof. We can use the same technique as in [3], building directly for a language L 2 RE? F a system in T T 9, and then remove tubes 1, 8 and 9. The resulting T T 6 system will still generate a language in RE? F thanks to the closure properties of F. 2 Our result is still dierent from designing in detail a universal splicing system, similar to the current programmable computers, but it takes us closer to a practical implementation of a DNA computer: for each computation (language) we want, we just change the starting molecules and the restriction enzymes introduced in the test tubes, we do not change the layout on our workbench for each alphabet we need. Of course it is still a practical problem to have enough real restriction enzymes. This work has been insightful to study a case where a simple algorithm has been designed directly in terms of splicing; an algorithm not simply reproducing an usual grammatical production rule, but doing some dierent basic operation (encoding/decoding). This, of course, is not the rst case in literature, but we feel that the interest in this molecular algorithm engineering can eventually lead us to build a kind of universal grammar systems based on molecular-like operations, avoiding the uneective translations of universal Turing machines seen so far. Many interesting open problems suggested in [3] still are open, concerning the power of dierent numbers of test tubes and comparisons to dierent levels of Chomsky hierarchy. We can only add now that it is interesting to check whether it is possible to use less than 9 tubes for RE, since it is not proved that T T 8 (F IN; F IN) is properly contained in RE. Acknowledgments The authors would like to thank Gheorghe Paun for many useful discussions on these topics. References [1] Proceedings of Second DIMACS workshop on DNA computing, Princeton, 1996, to be published by ACM Press. [2] L. M. Adleman, Molecular computation of solutions of combinatorial problems, Science, 226 (1994), 1021{1024. [3] E. Csuhaj-Varju, L. Kari, G. Paun, Test Tube distributed system based on splicing, Computer and AI, 15, 2-3 (1996), 211{232. [4] T. Head, Formal language theory and DNA: an analysis of the generative capacity of specic recombinant behaviours, Bull. Math. Biology, 49 (1987), 737{759. [5] C. Zandron, C. Ferretti, G. Mauri, A reduced distributed splicing system for RE Languages, submitted for publication. 12
How to Pop a Deep PDA Matters
How to Pop a Deep PDA Matters Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University Kyoto 603-8555, Japan email:leupold@cc.kyoto-su.ac.jp Abstract Deep PDA are push-down automata
More informationPower and size of extended Watson Crick L systems
Theoretical Computer Science 290 (2003) 1665 1678 www.elsevier.com/locate/tcs Power size of extended Watson Crick L systems Judit Csima a, Erzsebet Csuhaj-Varju b; ;1, Arto Salomaa c a Department of Computer
More informationOn P Systems with Active Membranes
On P Systems with Active Membranes Andrei Păun Department of Computer Science, University of Western Ontario London, Ontario, Canada N6A 5B7 E-mail: apaun@csd.uwo.ca Abstract. The paper deals with the
More informationautomaton model of self-assembling systems is presented. The model operates on one-dimensional strings that are assembled from a given multiset of sma
Self-Assembling Finite Automata Andreas Klein Institut fur Mathematik, Universitat Kassel Heinrich Plett Strae 40, D-34132 Kassel, Germany klein@mathematik.uni-kassel.de Martin Kutrib Institut fur Informatik,
More informationON MINIMAL CONTEXT-FREE INSERTION-DELETION SYSTEMS
ON MINIMAL CONTEXT-FREE INSERTION-DELETION SYSTEMS Sergey Verlan LACL, University of Paris XII 61, av. Général de Gaulle, 94010, Créteil, France e-mail: verlan@univ-paris12.fr ABSTRACT We investigate the
More informationComputability and Complexity
Computability and Complexity Decidability, Undecidability and Reducibility; Codes, Algorithms and Languages CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario,
More informationComputability and Complexity
Computability and Complexity Push-Down Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationTHEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET
THEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET Regular Languages and FA A language is a set of strings over a finite alphabet Σ. All languages are finite or countably infinite. The set of all languages
More informationComputational Power of Gene Rearrangement. Lila Kari and Laura F. Landweber
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Computational Power of Gene Rearrangement Lila Kari and Laura F. Landweber Abstract. In [8] we proposed a model to describe the homologous
More informationDistributed-Automata and Simple Test Tube Systems. Prahladh Harsha
Distributed-Automata and Simple Test Tube Systems A Project Report Submitted in partial fulfillment of the requirements of the degree of Bachelor of Technology in Computer Science and Engineering by Prahladh
More informationLeft-Forbidding Cooperating Distributed Grammar Systems
Left-Forbidding Cooperating Distributed Grammar Systems Filip Goldefus a, Tomáš Masopust b,, Alexander Meduna a a Faculty of Information Technology, Brno University of Technology Božetěchova 2, Brno 61266,
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A context-free grammar is in Chomsky normal form if every rule is of the form:
More informationOn Controlled P Systems
On Controlled P Systems Kamala Krithivasan 1, Gheorghe Păun 2,3, Ajeesh Ramanujan 1 1 Department of Computer Science and Engineering Indian Institute of Technology, Madras Chennai-36, India kamala@iitm.ac.in,
More informationP Systems with Symport/Antiport of Rules
P Systems with Symport/Antiport of Rules Matteo CAVALIERE Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tárraco 1, 43005 Tarragona, Spain E-mail: matteo.cavaliere@estudiants.urv.es
More informationComputability and Complexity
Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationA Graph Based Parsing Algorithm for Context-free Languages
A Graph Based Parsing Algorithm for Context-free Languages Giinter Hot> Technical Report A 01/99 June 1999 e-mail: hotzocs.uni-sb.de VVVVVV: http://vwv-hotz.cs.uni-sb. de Abstract We present a simple algorithm
More informationSolvability of Word Equations Modulo Finite Special And. Conuent String-Rewriting Systems Is Undecidable In General.
Solvability of Word Equations Modulo Finite Special And Conuent String-Rewriting Systems Is Undecidable In General Friedrich Otto Fachbereich Mathematik/Informatik, Universitat GH Kassel 34109 Kassel,
More informationParsing. Context-Free Grammars (CFG) Laura Kallmeyer. Winter 2017/18. Heinrich-Heine-Universität Düsseldorf 1 / 26
Parsing Context-Free Grammars (CFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Winter 2017/18 1 / 26 Table of contents 1 Context-Free Grammars 2 Simplifying CFGs Removing useless symbols Eliminating
More informationComputability Theory
CS:4330 Theory of Computation Spring 2018 Computability Theory Decidable Problems of CFLs and beyond Haniel Barbosa Readings for this lecture Chapter 4 of [Sipser 1996], 3rd edition. Section 4.1. Decidable
More informationChomsky Normal Form and TURING MACHINES. TUESDAY Feb 4
Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A context-free grammar is in Chomsky normal form if every rule is of the form: A BC A a S ε B and C aren t start variables a is
More informationNonterminal complexity of programmed grammars
Theoretical Computer Science 296 (2003) 225 251 www.elsevier.com/locate/tcs Nonterminal complexity of programmed grammars Henning Fernau School of Electrical Engineering and Computer Science, University
More informationA shrinking lemma for random forbidding context languages
Theoretical Computer Science 237 (2000) 149 158 www.elsevier.com/locate/tcs A shrinking lemma for random forbidding context languages Andries van der Walt a, Sigrid Ewert b; a Department of Mathematics,
More informationPreface These notes were prepared on the occasion of giving a guest lecture in David Harel's class on Advanced Topics in Computability. David's reques
Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Spring 2002 Abstract This text consists
More informationSome hierarchies for the communication complexity measures of cooperating grammar systems
Some hierarchies for the communication complexity measures of cooperating grammar systems Juraj Hromkovic 1, Jarkko Kari 2, Lila Kari 2 June 14, 2010 Abstract We investigate here the descriptional and
More informationHybrid Transition Modes in (Tissue) P Systems
Hybrid Transition Modes in (Tissue) P Systems Rudolf Freund and Marian Kogler Faculty of Informatics, Vienna University of Technology Favoritenstr. 9, 1040 Vienna, Austria {rudi,marian}@emcc.at Summary.
More informationVariable Length Codes for Degraded Broadcast Channels
Variable Length Codes for Degraded Broadcast Channels Stéphane Musy School of Computer and Communication Sciences, EPFL CH-1015 Lausanne, Switzerland Email: stephane.musy@ep.ch Abstract This paper investigates
More informationOn String Languages Generated by Numerical P Systems
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 8, Number 3, 205, 273 295 On String Languages Generated by Numerical P Systems Zhiqiang ZHANG, Tingfang WU, Linqiang PAN, Gheorghe PĂUN2 Key
More informationAccepting H-Array Splicing Systems and Their Properties
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 21 Number 3 2018 298 309 Accepting H-Array Splicing Systems and Their Properties D. K. SHEENA CHRISTY 1 V.MASILAMANI 2 D. G. THOMAS 3 Atulya
More informationP Finite Automata and Regular Languages over Countably Infinite Alphabets
P Finite Automata and Regular Languages over Countably Infinite Alphabets Jürgen Dassow 1 and György Vaszil 2 1 Otto-von-Guericke-Universität Magdeburg Fakultät für Informatik PSF 4120, D-39016 Magdeburg,
More informationCS481F01 Prelim 2 Solutions
CS481F01 Prelim 2 Solutions A. Demers 7 Nov 2001 1 (30 pts = 4 pts each part + 2 free points). For this question we use the following notation: x y means x is a prefix of y m k n means m n k For each of
More informationDecidability of Existence and Construction of a Complement of a given function
Decidability of Existence and Construction of a Complement of a given function Ka.Shrinivaasan, Chennai Mathematical Institute (CMI) (shrinivas@cmi.ac.in) April 28, 2011 Abstract This article denes a complement
More informationMultitape Ordinal Machines and Primitive Recursion
Multitape Ordinal Machines and Primitive Recursion Bernhard Irrgang and Benjamin Seyerth University of Bonn, Mathematical Institute Beringstraÿe 1, D-53115 Bonn, Germany irrgang@math.uni-bonn.de, benjamin.seyfferth@gmx.de
More informationIntroduction to Formal Languages, Automata and Computability p.1/42
Introduction to Formal Languages, Automata and Computability Pushdown Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/42 Introduction We have considered
More informationFall 1999 Formal Language Theory Dr. R. Boyer. Theorem. For any context free grammar G; if there is a derivation of w 2 from the
Fall 1999 Formal Language Theory Dr. R. Boyer Week Seven: Chomsky Normal Form; Pumping Lemma 1. Universality of Leftmost Derivations. Theorem. For any context free grammar ; if there is a derivation of
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/10/2018 at 23:28:03 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationPower of controlled insertion and deletion
Power of controlled insertion and deletion Lila Kari Academy of Finland and Department of Mathematics 1 University of Turku 20500 Turku Finland Abstract The paper investigates classes of languages obtained
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
More informationArray Insertion and Deletion P Systems
Array Insertion and Deletion P Systems Henning Fernau 1 Rudolf Freund 2 Sergiu Ivanov 3 Marion Oswald 2 Markus L. Schmid 1 K.G. Subramanian 4 1 Universität Trier, D-54296 Trier, Germany Email: {fernau,mschmid}@uni-trier.de
More informationContext Free Grammars
Automata and Formal Languages Context Free Grammars Sipser pages 101-111 Lecture 11 Tim Sheard 1 Formal Languages 1. Context free languages provide a convenient notation for recursive description of languages.
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars formal properties Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2018 1 / 20 Normal forms (1) Hopcroft and Ullman (1979) A normal
More informationDecision Problems Concerning. Prime Words and Languages of the
Decision Problems Concerning Prime Words and Languages of the PCP Marjo Lipponen Turku Centre for Computer Science TUCS Technical Report No 27 June 1996 ISBN 951-650-783-2 ISSN 1239-1891 Abstract This
More informationThe rest of the paper is organized as follows: in Section 2 we prove undecidability of the existential-universal ( 2 ) part of the theory of an AC ide
Undecidability of the 9 8 part of the theory of ground term algebra modulo an AC symbol Jerzy Marcinkowski jma@tcs.uni.wroc.pl Institute of Computer Science University of Wroc law, ul. Przesmyckiego 20
More informationMA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
More informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages Context-Free Languages Regular Languages
More informationFinite H-Systems with 3 Test Tubes are not Predictable Lutz Priese, Yurii Rogojine, Maurice Margenstern 24/97 Fachberichte INFORMATIK Universitat Koblenz-Landau Institut fur Informatik, Rheinau 1, D-56075
More informationThe Accepting Power of Finite. Faculty of Mathematics, University of Bucharest. Str. Academiei 14, 70109, Bucharest, ROMANIA
The Accepting Power of Finite Automata Over Groups Victor Mitrana Faculty of Mathematics, University of Bucharest Str. Academiei 14, 70109, Bucharest, ROMANIA Ralf STIEBE Faculty of Computer Science, University
More informationFLAC Context-Free Grammars
FLAC Context-Free Grammars Klaus Sutner Carnegie Mellon Universality Fall 2017 1 Generating Languages Properties of CFLs Generation vs. Recognition 3 Turing machines can be used to check membership in
More informationChapter 3. Regular grammars
Chapter 3 Regular grammars 59 3.1 Introduction Other view of the concept of language: not the formalization of the notion of effective procedure, but set of words satisfying a given set of rules Origin
More informationA strip-like tiling algorithm
Theoretical Computer Science 282 (2002) 337 352 www.elsevier.com/locate/tcs A strip-like tiling algorithm Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri Dipartimento di Sistemi e Informatica, via
More informationsplicing systems coincides with the family SLT of strictly locally testable languages which is a subfamily of the regular languages that was introduce
Splicing Representations of Strictly Locally Testable Languages Tom Head Mathematical Sciences Binghamton University Binghamton, NY 13902-6000 tom@math.binghamton.edu Abstract The relationship between
More informationBlackhole Pushdown Automata
Fundamenta Informaticae XXI (2001) 1001 1020 1001 IOS Press Blackhole Pushdown Automata Erzsébet Csuhaj-Varjú Computer and Automation Research Institute, Hungarian Academy of Sciences Kende u. 13 17, 1111
More informationUNIT II REGULAR LANGUAGES
1 UNIT II REGULAR LANGUAGES Introduction: A regular expression is a way of describing a regular language. The various operations are closure, union and concatenation. We can also find the equivalent regular
More informationIntroduction to Theory of Computing
CSCI 2670, Fall 2012 Introduction to Theory of Computing Department of Computer Science University of Georgia Athens, GA 30602 Instructor: Liming Cai www.cs.uga.edu/ cai 0 Lecture Note 3 Context-Free Languages
More informationRegular Path Expressions in Feature Logic y ROLF BACKOFEN. We examine the existential fragment of a feature logic, which is extended by regular path
J. Symbolic Computation (1994) 17, 421{455 Regular Path Expressions in Feature Logic y ROLF BACKOFEN DFKI, Stuhlsatzenhausweg 3, W6600 Saarbrucken, Germany (Received 30 May 1994) We examine the existential
More information5 3 Watson-Crick Automata with Several Runs
5 3 Watson-Crick Automata with Several Runs Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University, Japan Joint work with Benedek Nagy (Debrecen) Presentation at NCMA 2009
More informationTheory of Computation p.1/?? Theory of Computation p.2/?? We develop examples of languages that are decidable
Decidable Languages We use languages to represent various computational problems because we have a terminology for dealing with languages Definition: A language is decidable if there is an algorithm (i.e.
More informationSection 1 (closed-book) Total points 30
CS 454 Theory of Computation Fall 2011 Section 1 (closed-book) Total points 30 1. Which of the following are true? (a) a PDA can always be converted to an equivalent PDA that at each step pops or pushes
More informationNPDA, CFG equivalence
NPDA, CFG equivalence Theorem A language L is recognized by a NPDA iff L is described by a CFG. Must prove two directions: ( ) L is recognized by a NPDA implies L is described by a CFG. ( ) L is described
More informationInsertion operations: closure properties
Insertion operations: closure properties Lila Kari Academy of Finland and Mathematics Department 1 Turku University 20 500 Turku, Finland 1 Introduction The basic notions used for specifying languages
More informationConflict Removal. Less Than, Equals ( <= ) Conflict
Conflict Removal As you have observed in a recent example, not all context free grammars are simple precedence grammars. You have also seen that a context free grammar that is not a simple precedence grammar
More informationParikh s theorem. Håkan Lindqvist
Parikh s theorem Håkan Lindqvist Abstract This chapter will discuss Parikh s theorem and provide a proof for it. The proof is done by induction over a set of derivation trees, and using the Parikh mappings
More informationComputability and Complexity
Computability and Complexity Rewriting Systems and Chomsky Grammars CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard
More informationP systems based on tag operations
Computer Science Journal of Moldova, vol.20, no.3(60), 2012 P systems based on tag operations Yurii Rogozhin Sergey Verlan Abstract In this article we introduce P systems using Post s tag operation on
More informationTuring s thesis: (1930) Any computation carried out by mechanical means can be performed by a Turing Machine
Turing s thesis: (1930) Any computation carried out by mechanical means can be performed by a Turing Machine There is no known model of computation more powerful than Turing Machines Definition of Algorithm:
More informationDNA computing, sticker systems, and universality
Acta Informatica 35, 401 420 1998 c Springer-erlag 1998 DNA computing, sticker systems, and universality Lila Kari 1, Gheorghe Păun 2, Grzegorz Rozenberg 3, Arto Salomaa 4, Sheng Yu 1 1 Department of Computer
More informationCSCE 551: Chin-Tser Huang. University of South Carolina
CSCE 551: Theory of Computation Chin-Tser Huang huangct@cse.sc.edu University of South Carolina Church-Turing Thesis The definition of the algorithm came in the 1936 papers of Alonzo Church h and Alan
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 14: Applications of PCP Goal of this Lecture Our goal is to present some typical undecidability
More information(ADVANCED) PROOF AND COMPUTATION. Semester II 2015/ Introduction
Semester II 2015/2016 1. Introduction 1.1. Hilbert's Program. At the end of the 19th century, Cantor and Frege developed naive set theory, which was supposed to allow to treat sets as actual mathematical
More informationUndecidability. Andreas Klappenecker. [based on slides by Prof. Welch]
Undecidability Andreas Klappenecker [based on slides by Prof. Welch] 1 Sources Theory of Computing, A Gentle Introduction, by E. Kinber and C. Smith, Prentice-Hall, 2001 Automata Theory, Languages and
More informationFunctional Database Query Languages as. Typed Lambda Calculi of Fixed Order. Gerd G. Hillebrand and Paris C. Kanellakis
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order Gerd G. Hillebrand and Paris C. Kanellakis Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-26
More informationAlmost Optimal Sublinear Time Parallel. Lawrence L. Larmore. Wojciech Rytter y. Abstract
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Contet Free Languages Lawrence L. Larmore Wojciech Rytter y Abstract Sublinear time almost optimal algorithms for the
More informationform, but that fails as soon as one has an object greater than every natural number. Induction in the < form frequently goes under the fancy name \tra
Transnite Ordinals and Their Notations: For The Uninitiated Version 1.1 Hilbert Levitz Department of Computer Science Florida State University levitz@cs.fsu.edu Intoduction This is supposed to be a primer
More informationUsing DNA to Solve NP-Complete Problems. Richard J. Lipton y. Princeton University. Princeton, NJ 08540
Using DNA to Solve NP-Complete Problems Richard J. Lipton y Princeton University Princeton, NJ 08540 rjl@princeton.edu Abstract: We show how to use DNA experiments to solve the famous \SAT" problem of
More informationFundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 5 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 5.1.a (q 0, ab, Z 0 ) (q 1, b,
More informationThe Pumping Lemma. for all n 0, u 1 v n u 2 L (i.e. u 1 u 2 L, u 1 vu 2 L [but we knew that anyway], u 1 vvu 2 L, u 1 vvvu 2 L, etc.
The Pumping Lemma For every regular language L, there is a number l 1 satisfying the pumping lemma property: All w L with w l can be expressed as a concatenation of three strings, w = u 1 vu 2, where u
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 14 Ana Bove May 14th 2018 Recap: Context-free Grammars Simplification of grammars: Elimination of ǫ-productions; Elimination of
More informationTuring Machines Part III
Turing Machines Part III Announcements Problem Set 6 due now. Problem Set 7 out, due Monday, March 4. Play around with Turing machines, their powers, and their limits. Some problems require Wednesday's
More informationNote: In any grammar here, the meaning and usage of P (productions) is equivalent to R (rules).
Note: In any grammar here, the meaning and usage of P (productions) is equivalent to R (rules). 1a) G = ({R, S, T}, {0,1}, P, S) where P is: S R0R R R0R1R R1R0R T T 0T ε (S generates the first 0. R generates
More informationContext-Free and Noncontext-Free Languages
Examples: Context-Free and Noncontext-Free Languages a*b* is regular. A n B n = {a n b n : n 0} is context-free but not regular. A n B n C n = {a n b n c n : n 0} is not context-free The Regular and the
More informationKirsten Lackner Solberg. Dept. of Math. and Computer Science. Odense University, Denmark
Inference Systems for Binding Time Analysis Kirsten Lackner Solberg Dept. of Math. and Computer Science Odense University, Denmark e-mail: kls@imada.ou.dk June 21, 1993 Contents 1 Introduction 4 2 Review
More informationAnalog Neural Nets with Gaussian or other Common. Noise Distributions cannot Recognize Arbitrary. Regular Languages.
Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages Wolfgang Maass Inst. for Theoretical Computer Science, Technische Universitat Graz Klosterwiesgasse
More informationTAKE-HOME: OUT 02/21 NOON, DUE 02/25 NOON
CSE 555 MIDTERM EXAMINATION SOLUTIONS TAKE-HOME: OUT 02/21 NOON, DUE 02/25 NOON The completed test is to be submitted electronically to colbourn@asu.edu before the deadline, or time-stamped by the main
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationEinführung in die Computerlinguistik Kontextfreie Grammatiken - Formale Eigenschaften
Normal forms (1) Einführung in die Computerlinguistik Kontextfreie Grammatiken - Formale Eigenschaften Laura Heinrich-Heine-Universität Düsseldorf Sommersemester 2013 normal form of a grammar formalism
More informationstraight segment and the symbol b representing a corner, the strings ababaab, babaaba and abaabab represent the same shape. In order to learn a model,
The Cocke-Younger-Kasami algorithm for cyclic strings Jose Oncina Depto. de Lenguajes y Sistemas Informaticos Universidad de Alicante E-03080 Alicante (Spain) e-mail: oncina@dlsi.ua.es Abstract The chain-code
More informationGrammars (part II) Prof. Dan A. Simovici UMB
rammars (part II) Prof. Dan A. Simovici UMB 1 / 1 Outline 2 / 1 Length-Increasing vs. Context-Sensitive rammars Theorem The class L 1 equals the class of length-increasing languages. 3 / 1 Length-Increasing
More informationNote On Parikh slender context-free languages
Theoretical Computer Science 255 (2001) 667 677 www.elsevier.com/locate/tcs Note On Parikh slender context-free languages a; b; ; 1 Juha Honkala a Department of Mathematics, University of Turku, FIN-20014
More informationClaude Marche. Bat 490, Universite Paris-Sud. Abstract
The Word Problem of ACD-Ground theories is Undecidable Claude Marche Laboratoire de Recherche en Informatique (UA 410 CNRS) Bat 490, Universite Paris-Sud 91405 ORSAY CEDEX, FRANCE E-mail: marche@lri.lri.fr
More informationUndecidability of ground reducibility. for word rewriting systems with variables. Gregory KUCHEROV andmichael RUSINOWITCH
Undecidability of ground reducibility for word rewriting systems with variables Gregory KUCHEROV andmichael RUSINOWITCH Key words: Theory of Computation Formal Languages Term Rewriting Systems Pattern
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationFunctions on languages:
MA/CSSE 474 Final Exam Notation and Formulas page Name (turn this in with your exam) Unless specified otherwise, r,s,t,u,v,w,x,y,z are strings over alphabet Σ; while a, b, c, d are individual alphabet
More informationOgden s Lemma for CFLs
Ogden s Lemma for CFLs Theorem If L is a context-free language, then there exists an integer l such that for any u L with at least l positions marked, u can be written as u = vwxyz such that 1 x and at
More information2 C. A. Gunter ackground asic Domain Theory. A poset is a set D together with a binary relation v which is reexive, transitive and anti-symmetric. A s
1 THE LARGEST FIRST-ORDER-AXIOMATIZALE CARTESIAN CLOSED CATEGORY OF DOMAINS 1 June 1986 Carl A. Gunter Cambridge University Computer Laboratory, Cambridge C2 3QG, England Introduction The inspiration for
More information1 Introduction A general problem that arises in dierent areas of computer science is the following combination problem: given two structures or theori
Combining Unication- and Disunication Algorithms Tractable and Intractable Instances Klaus U. Schulz CIS, University of Munich Oettingenstr. 67 80538 Munchen, Germany e-mail: schulz@cis.uni-muenchen.de
More information615, rue du Jardin Botanique. Abstract. In contrast to the case of words, in context-free tree grammars projection rules cannot always be
How to Get Rid of Projection Rules in Context-free Tree Grammars Dieter Hofbauer Maria Huber Gregory Kucherov Technische Universit t Berlin Franklinstra e 28/29, FR 6-2 D - 10587 Berlin, Germany e-mail:
More informationP. Flocchini and F. Geurts. UCL, INFO, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Belgium
Searching for Chaos in Cellular Automata: New Tools for Classication P. Flocchini and F. Geurts DSI, Via Comelico 39, 20135 Milano, Italy UCL, INFO, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Belgium
More informationSome Operations Preserving Primitivity of Words
J. Dassow, B. Truthe (Eds.): Colloquium on the Occasion of the 50 th Birthday of Victor Mitrana. Otto von Guericke Universität Magdeburg, Germany, June 27, 2008. Proceedings, pages 11 28. Some Operations
More information