IT & Software Office Design Business & Finance Humanities Lifestyle Sciences Photography & Video Music Consultations View all subjects

Skillshare Coursera MemRise Pluralsight Udemy edX The Great Courses TutorialsPoint Edureka LearnDirect View all subjects

Johns Hopkins University Stanford University Duke University University of Pennsylvania Harvard University Massachusetts Institute of Technology Rice University Delft University of Technology New York Institute of Finance Princeton University View all subjects

IBM Amazon Web Services Microsoft The International Monetary Fund The Linux Foundation IsraelX Autodesk LOGYCA Infosec INSEAD View all subjects

Web DevelopmentComputer ScienceData ScienceDatabasesMobile DevelopmentGame DevelopmentProgramming LanguagesDevOpsHardwareView all

User Experience DesignWeb DesignGraphic Design & Illustration3D & AnimationArchitectural DesignInterior DesignView all

ManagementCommunicationProduct ManagementAccountingFinanceMarketingBlockchain & CryptocurrencyInvesting & TradingView all

There is 0 item now in your comparison listView a comparison list

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. 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 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. Finally, we see the pumping lemma for regular languages -- a way of proving that certain languages are not regular languages.

Our second topic is context-free grammars and their languages. 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. We also introduce the pushdown automaton, whose nondeterministic version is equivalent in language-defining power to context-free grammars.

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 shall learn how "problems" (mathematical questions) can be expressed as languages. That lets us define problems to be "decidable" if their language can be defined by a Turing machine and "undecidable" if not. We shall see some basic undecidable problems, for example, it is undecidable whether the intersection of two context-free languages is empty.

Last, we look at the theory of intractable problems. 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. We meet the NP-complete problems, a large class of intractable problems. This class includes many of the hard combinatorial problems that have been assumed for decades or even centuries to require exponential time, and we learn that either none or all of these problems have polynomial-time algorithms. A common example of an NP-complete problem is SAT, the question of whether a Boolean expression has a truth-assignment to its variables that makes the expression itself true.

- Finite automata and regular expressions
- Context-free grammars
- Turing machines and decidability
- The theory of intractability, or NP-complete problems

Similar items

Help others make their choice. Be the first one to leave a review

Leave a review