These are problems that, while they are decidable, have almost certainly no algorithm that runs in time less than some exponential function of the size of their input. Last, we look at the theory of intractable problems. We shall see some basic undecidable problems, for example, it is undecidable whether the intersection of two context-free languages is empty. That lets us define problems to be "decidable" if their language can be defined by a Turing machine and "undecidable" if not. We shall learn how "problems" (mathematical questions) can be expressed as languages. Next, we introduce the Turing machine, a kind of automaton that can define all the languages that can reasonably be said to be definable by any sort of computing device (the so-called "recursively enumerable languages"). We also introduce the pushdown automaton, whose nondeterministic version is equivalent in language-defining power to context-free grammars. We learn about parse trees and follow a pattern similar to that for finite automata: closure properties, decision properties, and a pumping lemma for context-free languages. Our second topic is context-free grammars and their languages. Finally, we see the pumping lemma for regular languages - a way of proving that certain languages are not regular languages. We consider decision properties of regular languages, e.g., the fact that there is an algorithm to tell whether or not the language defined by two finite automata are the same language. We also look at closure properties of the regular languages, e.g., the fact that the union of two regular languages is also a regular language. We begin with a study of finite automata and the languages they can define the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and the equivalence of these language-defining mechanisms. Click “ENROLL NOW” to visit edX and get more information on course details and enrollment. In a subset of these courses, you can pay to earn a verified certificate. Stanford courses offered through edX are subject to edX’s pricing structures. However, 10 hours per week is a good guess. The amount of work will vary, depending on your background and the ease with which you follow mathematical ideas. However, should you wish to do so, the textbook that matches the course most closely is Automata Theory, Languages, and Computation by Hopcroft, Motwani, and Ullman, Addison-Wesley, 2007. The class is self-contained, and you are not expected to purchase or steal a textbook. An SoA with Distinction requires 85% of the marks. You get a signed SoA from the instructor if you get 50% of the marks (roughly half for homework, half for the final). Paid after free trial Units Notes Statement of accomplishment
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |