Mod-01 Lec-02 Alphabet, Strings, Languages

Symbol | Alphabet | String | basic Definations | TOC | Lec-02 | Bhanu PriyaПодробнее

Mod-05 Lec-02 FA REПодробнее

Mod-03 Lec-02 Nondeterministic Finite AutomataПодробнее

Mod-01 Lec-02 Alphabet, Strings, LanguagesПодробнее

Mod-01 Lec-03 Finite RepresentationПодробнее

Mod-04 Lec-02 MinimizationПодробнее

Mod-02 Lec-02 Lexical Analysis - Part 1Подробнее

Mod-02 Lec-03 Lexical Analysis - Part 2Подробнее

Mod-01 Lec-01 What is theory of computation?Подробнее

Mod-01 Lec-37 Notion of non-acceptance or rejection of a string by a TM. Multitrack TMПодробнее

Mod-01 Lec-02 Introduction to finite automaton.Подробнее

Mod-01 Lec-21 Languages generated by a cfg, leftmost derivation, more examples of cfgs and cfls.Подробнее

Mod-01 Lec-11 Regular expressions, they denote regular languages.Подробнее

Mod-08 Lec-40 GRAMMAR SYSTEMSПодробнее

Mod-02 Lec-12 EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARSПодробнее

Mod-01 Lec-02 GRAMMARS AND LANGUAGES GENERATEDПодробнее