Все публикации

Lecture-15: Type 11 - DFA that contains odd no. of specified symbol

Lecture-14: Type 10 - DFA that contains even no. of specified symbol

Lecture-13: Type 9- DFA for the strings whose nth last symbol is

Lecture-12: Type 8- DFA accepting string having length multiple of 'n'

Lecture-11: Type 7- DFA that contains exactly certain no. specific symbol

Lecture-10: Type 6- DFA for the strings that starts and ends with

Lecture-9: Type 5- DFA for the strings having length atleast

Lecture-8: Type 4- DFA that contains & does not contains certain no. of consecutive symbols

Lecture-7: Type 3- DFA that contains & does not contains certain substring

Lecture-6: Type 2- DFA for strings that starts & DFA for strings that does not starts with

Lecture-5: Type 1- DFA for strings that ends & DFA for strings that does not end with

Lecture-4: Deterministic Finite Automata (DFA)

Lecture-3 Finite Automata

Lecture-2 Preliminaries (TOC)

Lecture-1 (Introduction to Theory of Computation)