The definition of Kolmogorov structure functions for nondeterministic automatic complexity
|
|
- Primrose Stafford
- 5 years ago
- Views:
Transcription
1 The definition of Kolmogorov structure functions for nondeterministic automatic compleity Gregory Igusa Department of Mathematics University of otre Dame Bjørn Kjos-Hanssen Department of Mathematics University of Hawai i at Mānoa bjoernkh@hawaii.edu July 8, 2015 Abstract We show that two possible definitions of the Kolmogorov structure function for nondeterministic automatic compleity for a binary word do not coincide. These definitions count either the number of accepting paths, or the number of accepted words. Specifically, we show that the length 7 word is a witness of this non-coincidence.there is no shorter eample. In the area of compleity of finite sets of words of the same length, we show that {0110, 1111} has a compleity which depends on whether we are counting accepting paths or accepted words, as well. This work was partially supported by a grant from the Simons Foundation (# to Bjørn Kjos-Hanssen). The authors acknowledge the support of the Institut für Informatik at the University of Heidelberg, Germany during the workshop on Computability and Randomness, June 15 July 9,
2 m+1 q m 1 m start q 2 q 3 q 4... q m q m+1 n n 1 n 2 n 3 m+3 m+2 Figure 1: A nondeterministic finite automaton that only accepts one word = n of length n = 2m Introduction Shallit and Wang [6] introduced automatic compleity as a computable alternative to Kolmogorov compleity. They considered deterministic automata, whereas Hyde and Kjos-Hanssen [5] studied the nondeterministic case, which in some ways behaves better. Unfortunately, even nondeterministic automatic compleity is somewhat inadequate. The word has maimal nondeterministic compleity, even though intuitively it is quite simple. One way to remedy this situation is to consider a structure function analogous to that for Kolmogorov compleity. The latter was introduced by Kolmogorov at a 1973 meeting in Tallinn and studied by Vereshchagin and Vitányi [8] and Staiger [7]. Here we show that some notions in this area, in the non-deterministic setting, depend on whether we are counting accepting words or accepting paths. This is interesting because counting words is most efficient for compression, whereas counting paths is most efficient in terms of computational resources like time. 1.1 Definitions and technical motivation The Kolmogorov compleity of a finite word w is roughly speaking the length of the shortest description w of w in a fied formal language. The description w can be thought of as an optimally compressed version of w. Frustrated by the non-computability of Kolmogorov compleity, Shallit and Wang defined the following finite automaton analogue. In this paper we work only over the binary alphabet {0, 1} and denote by L(M) the language recognized by automaton M. Definition 1 (Shallit and Wang [6]). The automatic compleity of a finite binary word = 1... n is the least number A D () of states of a determin- 2
3 istic finite automaton M such that L(M) {0, 1} n = {}, that is, is the only word of length n accepted by M. Hyde and Kjos-Hanssen [5] defined a nondeterministic analogue. We assume that our FAs our not generalized, i.e., they have no ɛ-transitions. Definition 2. The nondeterministic automatic compleity A path (w) of a word w is the minimum number of states of an FA M, accepting w such that there is only one accepting path in M of length w. The minimum compleity A path (w) = 1 is only achieved by words of the form a n where a is a single letter. Definition 3. Let n = 2m+1 be a positive odd number, m 0. A finite automaton of the form given in Figure 1 for some choice of symbols 1,..., n and states q 1,..., q m+1 is called a Kayleigh graph. Theorem 4 (Hyde [2]). The nondeterministic automatic compleity A path () of a word of length n satisfies A path () n/ Proof. If n is odd, then a Kayleigh graph witnesses this inequality. If n is even, a slight modification suffices [2, 5]. There are two ways to define structure functions of a word, one dual to the other, that are both based on the same set S. The set S still has two versions, as we may count either paths or words. Definition 5. Suppose is a binary word of length n. Let (q, m) S word if there eists a q-state FA M with L(M) and L(M) {0, 1} n 2 m }. We let (q, m) S path if in addition M may be chosen to have at most 2 m accepting paths of length n. We note that S word From S word has the upward closure property q q, m m, (q, m) S word = (q, m ) S word. we can define the structure function h word and the dual struc-. The definition was presented to us by Vereshchagin ture function h word (personal communication, 2014), inspired by [8]. 3
4 Definition 6. The corresponding notions for S path h path h word (m) = min{k : (k, m) S word }, h word (k) = min{m : (k, m) S word }. we call h path and h path. ote that S path S word and hence h word (k) h path (k) and h word (m) (m) for each k, m, and,. Upper bounds on h word (k), generalizing the k = 0 case covered by Hyde s Theorem 4, were studied in [4]. It may be observed that the proofs given there are based on counting accepting paths and hence apply equally to h path. Coming back to our motivating eample of the word w = , the automaton in Figure 2 witnesses that the structure function of w is small at some points, despite its compleity attaining the maimum from Theorem Applications and further motivation As envisioned by Kolmogorov, structure functions have potential applications in computational statistics. While the problem of determining given a word and a number k whether A () k) is in P and may for all we know be P-complete, one can miniaturize by considering restricted sets of automata, thus obtaining efficiently computable notions of compleity [3]. One demonstration of this idea is the Structure Function Calculator available at the following URL: Apart from applications, automatic compleity has intrinsic interest as a toy version of Kolmogorov compleity; one may eplore it by playing the Compleity Guessing Game, at: A variation on the same idea is the Compleity Option Game, at: 2 Results 2.1 Automatic compleity of doubletons In what follows we consider automata with only a single accept state, although this is not essential. 4
5 0 1 0 start q 0 q 2 Figure 2: An automaton witnessing a small value h w (2) 3 for the structure function of w = There are 8 = 2 3 accepted words of length w. Definition 7. The word-based automatic compleity A word (F) of a finite set F { {0, 1} n to be the minimum number of states of an FA M such that L(M) {0, 1} n = F. The path-based automatic compleity A path (F) is the minimum number of states of an FA M such that in addition M has only F many accepting paths of length n. This generalizes automatic compleity from the case where F is a singleton. Clearly A word A path. We shall see in Theorem 9 that Aword (F) A path (F) in general when F = 2; and we shall conjecture in Conjecture 13 that A word (F) = Apath (F) whenever F = 1. Automatic compleity of doubletons is the case where F is a set with two distinct elements, {, y}, and has been studied by Chambers [1]. It is easy to obtain by calculation that, whether we count accepting paths or accepted words, at length n = 0, there are no doubletons; at length n = 1, the unique doubleton {0, 1} has compleity 1; at length n = 2, all the ( 4 2) = 6 doubletons have compleity 2; at length n = 3 there are ( ) = 28 doubletons, some of compleity 2 and the rest of compleity 3; and at length n = 4, the realized compleities are 3, 4, and 5. The upper bound of A path (F) 5 for n = 4 also follows from the following theorem, proved by Hyde [2] for f = 1 and by Chambers [1] for f = 2. Theorem 8. The automatic compleity of a set F {0, 1} n (with one accept state allowed) of size f satisfies A path (F) f n/
6 n \ f (1) (1) 1 (1) (2) 3 (2) 4 5(1) (2) 3 (3) (1) 4 3(3) 5 (5) (3) (4) (4) (5) (5) Figure 3: The Chambers Hyde upper bound on A path (F) from Theorem 8. Word length n and set size f = F. Actual maima in parentheses where known. Combinations not satisfying f 2 n are marked with. 1 1 q 0 start q 1 q 2 1 Figure 4: The optimal automaton C with L(C) {0, 1} 4 = {0110, 1111} by necessity accepts 1111 along two paths, giving Theorem Proof sketch. The proof is easy upon considering Figures 1 and 5. The upper bound in Theorem 8, which we can call the Chambers Hyde bound, appears to be sharp for f = 1 and perhaps, in general, for f << 2 n. It is not sharp for (n, f) = (2, 2) as there the maimum is 2 whereas the Chambers Hyde bound is 3. We now show that counting accepting paths is not equivalent to counting accepted words for the automatic compleity of doubletons, i.e., that A path A word. Theorem 9. There is an n and a finite set F {0, 1} n such that A word (F). A path (F) Proof. Let n = 4 and let F = {0110, 1111}. For any FA M such that L(M) {0, 1} 4 = F, M has at least 3 states, and M has at least 3 accepting 6
7 3 y y 2 y 4 1 y 1 start Figure 5: An automaton witnessing the Chambers Hyde bound (Theorem 8) for n = 4 and f = 2. paths of length 4; that is, the automaton C in Figure 4 is optimal. This is verified by a computer program available upon request, written in a similar style to that used for Theorem Structure functions We now show that the automatic compleity structure function of a word sometimes depends on whether we are counting accepting paths or accepted words. Theorem 10. There is a binary word and a k such that h word (k) < (k). h path Proof. Let = and let k = 3. We claim that h word (k) = 2 < 3 = h path (k). Let C 2 be the automaton given by the Kayleigh graph in Figure 6. inspection, L(C 2 ) {0, 1} 7 = { , , }. By 7
8 1 0 1 q 0 start q 1 q 2 0 Figure 6: The automaton C 2 giving us Theorem The automaton C 2 is optimal for the structure function of with m = 2. It accepts words. However, it has 5 > 2 2 accepting paths of length 7. The etra paths are associated with the word We claim that the number of accepting paths of length 7 is at least 5 in any automaton M with L(C 2 ) {0, 1} 7 = { , , } and at most 3 states. This claim is verified by computer using the code in the Appendi (Section 4.1). Remark 11. The length 7 in Theorem 10 is in fact minimal, as can also be verified by computer. 3 Towards resolving the case of compleity of singletons Definition 12. For a word, the word-based nondeterministic automatic compleity of is defined by or equivalently as A word ({}). A word () := h word (0), Conjecture 13. For all and k, A word () = Apath (). Conjecture 13 lies at the crossroads of, and indeed was the inspiration for, our two main results. Theorem 9: A word (F) Apath (F) for the doubleton F = {0110, 1111}. Conjecture 13 states that there is no singleton eample. Theorem 10: h word (k) h path (k) for the word , at k = 2. Conjecture 13 states that there is no eample with k = 0. Remark 14. We have made a minor computer investigation of Conjecture 13: it holds for binary strings of length at most 8. 8
9 q b start q a q c q e q d Figure 7: An automaton with q = 5 states accepting = (01) 5 and no other word of length n = 10. There are multiple accepting paths, and removing edges cannot remedy that fact. start q a y z q b start q a y q c z q d z q f z Figure 8: Two FAs M 1 (left) and M 2 with accepting a word w = 5 yz 5, where has length 6, y has length 1, and z has length 7. An edge labeled by a word of length greater than 1 represents a concatenated sequence of edges. Since the only solution to the equation 6u+7v+1 = 66 in nonnegative integers is (u, v) = (5, 5), L(M i ) {0, 1} 66 = {w} for both i. In M 1 there are multiple accepting paths, and removing edges cannot remedy that fact or transform M 1 into M 2. The multiple paths diverge, then come together for a while, and then diverge again. 9
10 We now give some evidence of the difficulty in settling the truth or falsity of Conjecture 13. A naïve first idea may be that we can prove Conjecture 13 simply by removing edges and states from any putative countereample. However, consider the automaton in Figure 7, a Kayleigh graph with all edges labeled 01 accepting only the word = (01) 5 of length 10. While there is an equivalent automaton with fewer edges and only one accepting path, it cannot be obtained from the original automaton in such a simple way. That is, is not accepted on any proper subset of edges and vertices. Using Lemma 15 below we shall be able to produce more interesting eamples intended to cast some doubt upon Conjecture 13. Lemma 15. Suppose 0, y 0 > 0. The equation a + py = a 0 + py 0 (1) has a unique solution in nonnegative integers (, y) provided p is prime, p does not divide a, 0 < p, and y 0 < a. Proof. Reducing mod p we have a( 0 ) p 0 Since p does not divide a, a p 0, and so since p is prime, 0 p 0. Thus = 0 + np for some n Z. If n < 0 then 0 p < 0, which contradicts the requirement that 0. If n > 0 then using y 0, a + py a( 0 + p) + p(0) > a 0 + py 0 contradicting (1). Thus n = 0 and the only solution is = 0. By Lemma 15, 6 + 7y = 65 has the unique solution = y = 5. In fact, a + py = 5(a + p) has a unique solution = y = 5 whenever p > 5 is prime and does not divide a > 5. Figure 8 gives a simple application of this conclusion, but we can go further than that: Theorem 16. For each t there eists an FA M such that 1. M accepts only one word of length n (*), 2. no other automaton obtained from M by deletion of edges and states has the property (*), 3. M accepts along two paths γ 1, γ 2 that diverge from each other, and after coming back together, diverge again, for a total of at least t times of diverging from each other. 10
11 Proof sketch. We have seen the cases t = 1 in Figure 7 and t = 2 in Figure 8. ow, by substitution we can etend Lemma 15 and the corresponding eample automaton in Figure 8 to more than two variables, and more than two periods of diverging paths, respectively. Starting from the equation 6 + 7y = 65 which by Lemma 15 has the unique solution = y = 5, we find a prime greater than 65, namely 67, and obtain by Lemma 15 that the equation y = 67(5) + 6(65) has the unique solution = 5, y = 65. Putting these together, the equation (6y + 7z) = 67(5) + 6(65) has the unique solution = y = z = 5. So we can create an iterated version of Figure 8 for t = 3 and, by repeating the above argument, for arbitrary t. Theorem 16 still does not really give us reason to doubt Conjecture 13. We finish this article by making a Conjecture 17 epressing the idea that Theorem 16 is, in a sense, optimal. Conjecture 17. Suppose M is an FA which accepts only one word of length n, via several paths. Suppose there is no way to delete edges and paths while maintaining the property of accepting only the one word of length n. Then is of the form = t i=1 u i y k i i v i where denotes concatenation. Moreover, as y i is read by M, y i edges are used each time, i.e., there is no repetition of edges within one of these k i occurrences of y i ; and there is also no repetition of edges during the processing of u i and v i. The edges traversed during the reading of u 1, y k 1 1,..., v t are all distinct; the only repetition occurs during individual subwords y k i i. 11
12 References [1] Patrick Chambers. Automatic compleity of doubletons. Verbal presentation as a final eam for MATH 657, University of Hawaii at Mānoa, Spring [2] Kayleigh Hyde. ondeterministic finite state compleity. Master s thesis, University of Hawaii at Manoa, U.S.A., [3] Bjørn Kjos-Hanssen. Kolmogorov structure functions for nondeterministic automatic compleity in computational statistics. In COCOA 2014, volume 8881 of Lecture otes in Comput. Sci., pages Springer, Heidelberg, [4] Bjørn Kjos-Hanssen. Kolmogorov structure functions for automatic compleity. Theoret. Comput. Sci., To appear. [5] Bjørn Kjos-Hanssen and Kayleigh Hyde. ondeterministic automatic compleity of almost square-free and strongly cube-free words. In CO- COO 2014, volume 8591 of Lecture otes in Comput. Sci., pages Springer, Heidelberg, [6] Jeffrey Shallit and Ming-Wei Wang. Automatic compleity of strings. J. Autom. Lang. Comb., 6(4): , nd Workshop on Descriptional Compleity of Automata, Grammars and Related Structures (London, O, 2000). [7] Ludwig Staiger. The Kolmogorov compleity of infinite words. Theoret. Comput. Sci., 383(2-3): , [8] ikolai K. Vereshchagin and Paul M. B. Vitányi. Kolmogorov s structure functions and model selection. IEEE Trans. Inform. Theory, 50(12): ,
13 4 Appendi 4.1 Python module automatonreports 1 from automatoncompleitysoda import S i m p l e S t r i n g s 3 d e f c h e c k S i m p l i c i t y ( seq, q, m=0) : 5 n = l e n ( seq ) b = ma( seq ) s = S i m p l e S t r i n g s ( q, n, b, m) s. compleity ( seq ) 9 r e t u r n s. numsimple ( ) 11 d e f getinversestructurefunctionforqequalthree ( myseq ) : 13 p r i n t p r i n t s t r ( myseq ) + = s t r i n g being c o n s i d e r e d 15 myq = 3 i f not (myq i n range ( 1, l e n ( myseq ) /2 + 2) ) : 17 r e t u r n f o r m i n range ( 0, l e n ( myseq ) + 1) : 19 i f c h e c k S i m p l i c i t y ( myseq, myq, m) : i f (myq!= 1) : 21 p r i n t h ˆ( 1) ( + s t r (myq) + )= + s t r (m) break 23 getinversestructurefunctionforqequalthree ( 25 ( 0, 1, 1, 1, 0, 0, 0 ) ) automatonreportssoda.py import numpy 2 import math 4.2 Python module automatoncompleity 4 c l a s s S i m p l e S t r i n g s : 6 d e f i n i t ( s e l f, q, n, b=2, m=0) : s e l f. q = q 8 s e l f. n = n s e l f. b = b 10 s e l f. twotom = 2 m s e l f. emptyttt = f r o z e n s e t ( ) 12 s e l f. matches = s e t ( ) 13
14 14 d e f compleity ( s e l f, seq ) : t t = numpy. z e r o s ( shape=( s e l f. q, s e l f. q ) ) 16 s e l f. compleitybounds ( ( ), tt, seq ) 18 d e f s l o w i n c r e a s e ( s e l f, seq ) : currma = 1 20 f o r j i n range ( 0, l e n ( seq ) ) : i f seq [ j ] > currma + 1 : 22 r e t u r n F a l s e i f seq [ j ] == currma + 1 : 24 currma += 1 i f currma == s e l f. q 1 : 26 r e t u r n True r e t u r n True 28 d e f checkmatching ( s e l f, seq, seq, t t t ) : 30 newttt = s e t ( t t t ) j = l e n ( seq ) 1 32 i f j >= 0 : p, pp = seq [ j ], seq [ j + 1 ] 34 edgeused = F a l s e f o r bb i n range ( 0, s e l f. b ) : 36 i f (p, pp, bb ) i n t t t : edgeused = True 38 i f bb!= seq [ j ] : r e t u r n 40 break i f not edgeused : 42 newttt. add ( ( p, pp, seq [ j ] ) ) i f l e n ( seq ) < s e l f. n : 44 f o r j i n range ( 0, s e l f. b ) : s e l f. checkmatching ( seq + ( j, ), seq, newttt ) 46 r e t u r n s e l f. matches. add ( seq ) 48 d e f numsimple ( s e l f ) : 50 r e t u r n l e n ( s e l f. matches ) 52 d e f compleitybounds ( s e l f, seq, tt, seq ) : 54 i f not s e l f. s l o w i n c r e a s e ( seq ) : r e t u r n 56 t r a n s i t i o n T a b l e = t t. copy ( ) i f l e n ( seq ) == s e l f. n : 58 newttt = s e t ( s e l f. emptyttt ) f o r nn i n range ( 0, l e n ( seq ) 1) : 60 p, pp = seq [ nn ], seq [ nn + 1 ] newttt. add ( 14
15 62 (p, pp, seq [ nn ] ) ) 64 f o r bb i n range ( 0, s e l f. b ) : i f (p, pp, bb ) in newttt : 66 i f bb!= seq [ nn ] : t r a n s i t i o n T a b l e [ seq [ nn ], seq [ nn + 1 ] ] = 2 68 j = l e n ( seq ) 1 i f j > 0 : 70 i f ( t r a n s i t i o n T a b l e [ seq [ j 1 ], seq [ j ] ] == 0) : t r a n s i t i o n T a b l e [ seq [ j 1 ], seq [ j ] ] = 1 72 testumber = numpy. l i n a l g. matri power ( t r a n s i t i o n T a b l e, j 74 ) [ 0, seq [ j ] ] i f ( testumber == 0) or ( testumber > s e l f. twotom) : 76 r e t u r n e l s e : 78 i f j == l e n ( seq ) : p r i n t 80 p r i n t s t r ( i n t ( testumber ) ) + = # o f paths matching p r i n t s t r ( seq ) + = s t a t e sequence 82 i f j < s e l f. n : f o r p i n range ( 0, s e l f. q ) : 84 i f p < s e l f. q 1 : s e l f. compleitybounds ( 86 seq + (p, ), t r a n s i t i o n T a b l e, seq ) 88 e l s e : s e l f. compleitybounds ( 90 seq + (p, ), t r a n s i t i o n T a b l e, seq ) 92 r e t u r n i f l e n ( seq ) == 0 : 94 s e l f. checkmatching ( seq, seq, s e l f. emptyttt ) i f l e n ( seq ) == s e l f. n : 96 s e l f. matches. add ( seq ) automatoncompleitysoda.py 15
16 Contents 1 Introduction Definitions and technical motivation Applications and further motivation Results Automatic compleity of doubletons Structure functions Towards resolving the case of compleity of singletons 8 4 Appendi Python module automatonreports Python module automatoncompleity
Kolmogorov structure functions for automatic complexity
Kolmogorov structure functions for automatic complexity Bjørn Kjos-Hanssen June 16, 2015 Varieties of Algorithmic Information, University of Heidelberg Internationales Wissenschaftssentrum History 1936:
More informationThe complexity of automatic complexity
The complexity of automatic complexity Bjørn Kjos-Hanssen Department of Mathematics University of Hawai i at Mānoa bjoernkh@hawaii.edu August 0, 205 Abstract We define the automatic complexity A(E) of
More informationNondeterministic automatic complexity of overlap-free and almost square-free words
Nondeterministic automatic complexity of overlap-free and almost square-free words Kayleigh K. Hyde Schmid College of Science & Technology Chapman University Orange, California, U.S.A. khyde@chapman.edu
More informationPS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010
University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationUNIT-VI PUSHDOWN AUTOMATA
Syllabus R09 Regulation UNIT-VI PUSHDOWN AUTOMATA The context free languages have a type of automaton that defined them. This automaton, called a pushdown automaton, is an extension of the nondeterministic
More informationThe Separating Words Problem
The Separating Words Problem Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1/54 The Simplest
More informationReversal of Regular Languages and State Complexity
Reversal of Regular Languages and State Complexity Juraj Šebej Institute of Computer Science, Faculty of Science, P. J. Šafárik University, Jesenná 5, 04001 Košice, Slovakia juraj.sebej@gmail.com Abstract.
More informationCSC173 Workshop: 13 Sept. Notes
CSC173 Workshop: 13 Sept. Notes Frank Ferraro Department of Computer Science University of Rochester September 14, 2010 1 Regular Languages and Equivalent Forms A language can be thought of a set L of
More informationThe Separating Words Problem
The Separating Words Problem Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit 1 / 48 An Advertisement
More informationTheory of Computation
Theory of Computation (Feodor F. Dragan) Department of Computer Science Kent State University Spring, 2018 Theory of Computation, Feodor F. Dragan, Kent State University 1 Before we go into details, what
More informationAvoiding Large Squares in Infinite Binary Words
Avoiding Large Squares in Infinite Binary Words arxiv:math/0306081v1 [math.co] 4 Jun 2003 Narad Rampersad, Jeffrey Shallit, and Ming-wei Wang School of Computer Science University of Waterloo Waterloo,
More informationChapter 6. Properties of Regular Languages
Chapter 6 Properties of Regular Languages Regular Sets and Languages Claim(1). The family of languages accepted by FSAs consists of precisely the regular sets over a given alphabet. Every regular set is
More informationTheory of Computation Lecture 1. Dr. Nahla Belal
Theory of Computation Lecture 1 Dr. Nahla Belal Book The primary textbook is: Introduction to the Theory of Computation by Michael Sipser. Grading 10%: Weekly Homework. 30%: Two quizzes and one exam. 20%:
More informationFinite Automata and Regular Languages
Finite Automata and Regular Languages Topics to be covered in Chapters 1-4 include: deterministic vs. nondeterministic FA, regular expressions, one-way vs. two-way FA, minimization, pumping lemma for regular
More informationComputer Sciences Department
1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER 3 objectives Finite automaton Infinite automaton Formal definition State diagram Regular and Non-regular
More informationCS243, Logic and Computation Nondeterministic finite automata
CS243, Prof. Alvarez NONDETERMINISTIC FINITE AUTOMATA (NFA) Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (67) 552-4333
More informationIntroduction to Languages and Computation
Introduction to Languages and Computation George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Languages and Computation July 2014
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 informationCISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata
CISC 4090: Theory of Computation Chapter Regular Languages Xiaolan Zhang, adapted from slides by Prof. Werschulz Section.: Finite Automata Fordham University Department of Computer and Information Sciences
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 informationNOTES ON AUTOMATA. Date: April 29,
NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then
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 informationDeciding whether a regular language is power-closed is PSPACE-complete
Deciding whether a regular language is power-closed is PSPACE-complete Yuval Filmus September 2, 2012 Abstract A regular language L is power-closed if whenever x L, also x k L for all k 1. We show that
More informationComputational Models #1
Computational Models #1 Handout Mode Nachum Dershowitz & Yishay Mansour March 13-15, 2017 Nachum Dershowitz & Yishay Mansour Computational Models #1 March 13-15, 2017 1 / 41 Lecture Outline I Motivation
More information(Refer Slide Time: 0:21)
Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata
More informationCSci 311, Models of Computation Chapter 4 Properties of Regular Languages
CSci 311, Models of Computation Chapter 4 Properties of Regular Languages H. Conrad Cunningham 29 December 2015 Contents Introduction................................. 1 4.1 Closure Properties of Regular
More informationarxiv: v2 [cs.fl] 29 Nov 2013
A Survey of Multi-Tape Automata Carlo A. Furia May 2012 arxiv:1205.0178v2 [cs.fl] 29 Nov 2013 Abstract This paper summarizes the fundamental expressiveness, closure, and decidability properties of various
More informationComputational Models: Class 3
Computational Models: Class 3 Benny Chor School of Computer Science Tel Aviv University November 2, 2015 Based on slides by Maurice Herlihy, Brown University, and modifications by Iftach Haitner and Yishay
More informationFinite Automata. Mahesh Viswanathan
Finite Automata Mahesh Viswanathan In this lecture, we will consider different models of finite state machines and study their relative power. These notes assume that the reader is familiar with DFAs,
More informationLecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2 Prepared by, Dr. Subhendu Kumar Rath, BPUT, Odisha. UNIT 2 Structure NON-DETERMINISTIC FINITE AUTOMATA
More informationEquivalence of Regular Expressions and FSMs
Equivalence of Regular Expressions and FSMs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Regular Language Recall that a language
More informationFinish K-Complexity, Start Time Complexity
6.045 Finish K-Complexity, Start Time Complexity 1 Kolmogorov Complexity Definition: The shortest description of x, denoted as d(x), is the lexicographically shortest string such that M(w) halts
More informationOpen Problems in Automata Theory: An Idiosyncratic View
Open Problems in Automata Theory: An Idiosyncratic View Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit
More informationCS Lecture 28 P, NP, and NP-Completeness. Fall 2008
CS 301 - Lecture 28 P, NP, and NP-Completeness Fall 2008 Review Languages and Grammars Alphabets, strings, languages Regular Languages Deterministic Finite and Nondeterministic Automata Equivalence of
More informationFinal Exam Comments. UVa - cs302: Theory of Computation Spring < Total
UVa - cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95-102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationFinite State Machines 2
Finite State Machines 2 Joseph Spring School of Computer Science 1COM0044 Foundations of Computation 1 Discussion Points In the last lecture we looked at: 1. Abstract Machines 2. Finite State Machines
More information2. Elements of the Theory of Computation, Lewis and Papadimitrou,
Introduction Finite Automata DFA, regular languages Nondeterminism, NFA, subset construction Regular Epressions Synta, Semantics Relationship to regular languages Properties of regular languages Pumping
More informationUndecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines
More informationCSE 211. Pushdown Automata. CSE 211 (Theory of Computation) Atif Hasan Rahman
CSE 211 Pushdown Automata CSE 211 (Theory of Computation) Atif Hasan Rahman Lecturer Department of Computer Science and Engineering Bangladesh University of Engineering & Technology Adapted from slides
More informationPrime Languages, Orna Kupferman, Jonathan Mosheiff. School of Engineering and Computer Science The Hebrew University, Jerusalem, Israel
Prime Languages, Orna Kupferman, Jonathan Mosheiff School of Engineering and Computer Science The Hebrew University, Jerusalem, Israel Abstract We say that a deterministic finite automaton (DFA) A is composite
More informationWhat we have done so far
What we have done so far DFAs and regular languages NFAs and their equivalence to DFAs Regular expressions. Regular expressions capture exactly regular languages: Construct a NFA from a regular expression.
More informationMathematics for linguists
1/13 Mathematics for linguists Gerhard Jäger gerhard.jaeger@uni-tuebingen.de Uni Tübingen, WS 2009/2010 November 26, 2009 2/13 The pumping lemma Let L be an infinite regular language over a finite alphabete
More informationClosure under the Regular Operations
Closure under the Regular Operations Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have
More informationLecture 2: Connecting the Three Models
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 2: Connecting the Three Models David Mix Barrington and Alexis Maciel July 18, 2000
More informationarxiv: v3 [cs.fl] 2 Jul 2018
COMPLEXITY OF PREIMAGE PROBLEMS FOR DETERMINISTIC FINITE AUTOMATA MIKHAIL V. BERLINKOV arxiv:1704.08233v3 [cs.fl] 2 Jul 2018 Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg,
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 informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More informationRemarks on Separating Words
Remarks on Separating Words Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit 2, and David A. Wilson MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar Street, Cambridge, MA 239, USA,
More informationCSE 311: Foundations of Computing. Lecture 23: Finite State Machine Minimization & NFAs
CSE : Foundations of Computing Lecture : Finite State Machine Minimization & NFAs State Minimization Many different FSMs (DFAs) for the same problem Take a given FSM and try to reduce its state set by
More informationIntroduction to Theoretical Computer Science. Motivation. Automata = abstract computing devices
Introduction to Theoretical Computer Science Motivation Automata = abstract computing devices Turing studied Turing Machines (= computers) before there were any real computers We will also look at simpler
More informationNP, polynomial-time mapping reductions, and NP-completeness
NP, polynomial-time mapping reductions, and NP-completeness In the previous lecture we discussed deterministic time complexity, along with the time-hierarchy theorem, and introduced two complexity classes:
More informationComputational Models - Lecture 1 1
Computational Models - Lecture 1 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. February 29/ March 02, 2016 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland EC720.01 - Math for Economists Boston College, Department of Economics Fall 2010 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationTheory Bridge Exam Example Questions
Theory Bridge Exam Example Questions Annotated version with some (sometimes rather sketchy) answers and notes. This is a collection of sample theory bridge exam questions. This is just to get some idea
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationCS 154, Lecture 3: DFA NFA, Regular Expressions
CS 154, Lecture 3: DFA NFA, Regular Expressions Homework 1 is coming out Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and
More informationLecture 4: Finite Automata
Administrivia Lecture 4: Finite Automata Everyone should now be registered electronically using the link on our webpage. If you haven t, do so today! I dliketohaveteamsformedbyfriday,ifpossible,butnextmonday
More information1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
More informationNotes on State Minimization
U.C. Berkeley CS172: Automata, Computability and Complexity Handout 1 Professor Luca Trevisan 2/3/2015 Notes on State Minimization These notes present a technique to prove a lower bound on the number of
More informationDESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
International Journal of Foundations of Computer Science Vol. 16, No. 5 (2005) 975 984 c World Scientific Publishing Company DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY HING LEUNG Department
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More informationWord-hyperbolic groups have real-time word problem
Word-hyperbolic groups have real-time word problem Derek F. Holt 1 Introduction Let G = X be a finitely generated group, let A = X X 1, and let A be the set of all words in A. For u, v A, we denote the
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationCSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS 1. [6 POINTS] For language L 1 = {0 n 1 m n, m 1, m n}, which string is in L 1? ANSWER: 0001111 is in L 1 (with n =
More informationLecture 3: Finite Automata
Administrivia Lecture 3: Finite Automata Everyone should now be registered electronically using the link on our webpage. If you haven t, do so today! I d like to have teams formed by next Monday at the
More informationRecap DFA,NFA, DTM. Slides by Prof. Debasis Mitra, FIT.
Recap DFA,NFA, DTM Slides by Prof. Debasis Mitra, FIT. 1 Formal Language Finite set of alphabets Σ: e.g., {0, 1}, {a, b, c}, { {, } } Language L is a subset of strings on Σ, e.g., {00, 110, 01} a finite
More informationNP-Completeness and Boolean Satisfiability
NP-Completeness and Boolean Satisfiability Mridul Aanjaneya Stanford University August 14, 2012 Mridul Aanjaneya Automata Theory 1/ 49 Time-Bounded Turing Machines A Turing Machine that, given an input
More informationLecture 7: More Arithmetic and Fun With Primes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July
More informationProperties of Regular Languages (2015/10/15)
Chapter 4 Properties of Regular Languages (25//5) Pasbag, Turkey Outline 4. Proving Languages Not to e Regular 4.2 Closure Properties of Regular Languages 4.3 Decision Properties of Regular Languages 4.4
More informationP is the class of problems for which there are algorithms that solve the problem in time O(n k ) for some constant k.
Complexity Theory Problems are divided into complexity classes. Informally: So far in this course, almost all algorithms had polynomial running time, i.e., on inputs of size n, worst-case running time
More informationVariable Automata over Infinite Alphabets
Variable Automata over Infinite Alphabets Orna Grumberg a, Orna Kupferman b, Sarai Sheinvald b a Department of Computer Science, The Technion, Haifa 32000, Israel b School of Computer Science and Engineering,
More informationGames derived from a generalized Thue-Morse word
Games derived from a generalized Thue-Morse word Aviezri S. Fraenkel, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel; fraenkel@wisdom.weizmann.ac.il
More informationRainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs
Rainbow Matchings of Size δ(g) in Properly Edge-Colored Graphs Jennifer Diemunsch Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, and Paul S. Wenger Abstract A rainbow matching in an edge-colored
More informationAdditive Number Theory and Automata
Additive Number Theory and Automata Jeffrey Shallit School of Computer Science, University of Waterloo Waterloo, ON N2L 3G1 Canada Joint work with Carlo Sanna Daniel Kane P. Madhusudan Dirk Nowotka Aayush
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More information1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u,
1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u, v, x, y, z as per the pumping theorem. 3. Prove that
More informationIntroduction to the Theory of Computing
Introduction to the Theory of Computing Lecture notes for CS 360 John Watrous School of Computer Science and Institute for Quantum Computing University of Waterloo June 27, 2017 This work is licensed under
More informationCS500 Homework #2 Solutions
CS500 Homework #2 Solutions 1. Consider the two languages Show that L 1 is context-free but L 2 is not. L 1 = {a i b j c k d l i = j k = l} L 2 = {a i b j c k d l i = k j = l} Answer. L 1 is the concatenation
More informationWe define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ,
Distinguishability Recall A deterministic finite automaton is a five-tuple M = (S,Σ,T,s 0,F) where S is a finite set of states, Σ is an alphabet the input alphabet, T : S Σ S is the transition function,
More informationAutomata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Spring 27 Alexis Maciel Department of Computer Science Clarkson University Copyright c 27 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
More information2 Generating Functions
2 Generating Functions In this part of the course, we re going to introduce algebraic methods for counting and proving combinatorial identities. This is often greatly advantageous over the method of finding
More informationACCUPLACER MATH 0310
The University of Teas at El Paso Tutoring and Learning Center ACCUPLACER MATH 00 http://www.academics.utep.edu/tlc MATH 00 Page Linear Equations Linear Equations Eercises 5 Linear Equations Answer to
More information3515ICT: Theory of Computation. Regular languages
3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,
More informationFinite repetition threshold for large alphabets
Finite repetition threshold for large alphabets Golnaz Badkobeh a, Maxime Crochemore a,b and Michael Rao c a King s College London, UK b Université Paris-Est, France c CNRS, Lyon, France January 25, 2014
More informationBüchi Automata and their closure properties. - Ajith S and Ankit Kumar
Büchi Automata and their closure properties - Ajith S and Ankit Kumar Motivation Conventional programs accept input, compute, output result, then terminate Reactive program : not expected to terminate
More informationCS256 Applied Theory of Computation
CS256 Applied Theory of Computation Compleity Classes III John E Savage Overview Last lecture on time-bounded compleity classes Today we eamine space-bounded compleity classes We prove Savitch s Theorem,
More information,
Kolmogorov Complexity Carleton College, CS 254, Fall 2013, Prof. Joshua R. Davis based on Sipser, Introduction to the Theory of Computation 1. Introduction Kolmogorov complexity is a theory of lossless
More informationLecture 3: Nondeterministic Finite Automata
Lecture 3: Nondeterministic Finite Automata September 5, 206 CS 00 Theory of Computation As a recap of last lecture, recall that a deterministic finite automaton (DFA) consists of (Q, Σ, δ, q 0, F ) where
More informationGEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I
GEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I Internal Examination 2017-18 B.Tech III Year VI Semester Sub: Theory of Computation (6CS3A) Time: 1 Hour 30 min. Max Marks: 40 Note: Attempt all three
More informationUNIT-III REGULAR LANGUAGES
Syllabus R9 Regulation REGULAR EXPRESSIONS UNIT-III REGULAR LANGUAGES Regular expressions are useful for representing certain sets of strings in an algebraic fashion. In arithmetic we can use the operations
More informationClosure Properties of Regular Languages. Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism
Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Properties Recall a closure property is a statement
More informationHow 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 informationTuring machines and linear bounded automata
and linear bounded automata Informatics 2A: Lecture 29 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 25 November, 2011 1 / 13 1 The Chomsky hierarchy: summary 2 3 4 2 / 13
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 5 CHAPTER 2 FINITE AUTOMATA 1. Deterministic Finite Automata DFA 2. Nondeterministic Finite Automata NDFA 3. Finite Automata
More informationCS21 Decidability and Tractability
CS21 Decidability and Tractability Lecture 8 January 24, 2018 Outline Turing Machines and variants multitape TMs nondeterministic TMs Church-Turing Thesis So far several models of computation finite automata
More information