Lec-16 I UNIT-1 Theory of Automata and Formal Languages I TAFL I GATEWAY CLASSES I AKTU

preview_player
Показать описание
CS IT & Allied COMBO Link

TAFL Full Course

All Courses in App

Join Telegram Channel 👇👇

Theory of Automata and Formal Languages I TAFL I GATEWAY CLASSES
Unit – 1
Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata, Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε-Transition, Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata.
Рекомендации по теме
Комментарии
Автор

No mam for time stamp 35:40 for making a dfa of the given diagram.... (the correct answer is the string should start with"aa" and should have "aa" as one of the sub strings in it....) dead state is used to take all the extra alphabet including the end state to unwanted state.

swayampandey
Автор

mam 35:56 m agar (aba) aa gya to vo final state nhi jayega or incomeplete reh jayega

amazingindianfacts
Автор

mam exam me table ya machine se ek chiz given hogi ?

khushisharma