Theory of Computation : Become a master of DFA

سرفصل های دوره

Master Deterministic Finite Automata of Theory of Computation as Theory of Computation forms core of computer science

1 - Introduction

1 - Introduction to Theory of Computation

2 - Set of all Strings possible over an Alphabet

3 - Empty String vs Empty Set vs Empty Language

4 - Number of strings possible over an alphabet of length n

2 - Introduction to Deterministic Finite Automata DFA

5 - DFA Explained with Example

6 - Renaming of states to make it more logical

7 - DFA vs Minimal DFA

8 - Representation of a DFA

3 - DFA based on length of string

9 - Minimal DFA that accepts strings of length greater than 2

10 - Minimal DFA that accepts strings of length less than 3

11 - DFA that accepts strings of length n

12 - DFA that accepts strings of length atleast n

13 - DFA that accepts strings of length atmost n

4 - DFA based on modulo operator

14 - DFA that accepts strings of even length

15 - How changing final states can change the language

16 - DFA based on length of string modulo 4

5 - DFA based on number of instances of a symbol in a string

17 - DFA based on number of as in a string

18 - Important points to note

19 - How to change the DFA depending on language modification

6 - DFA based on number of instances of a symbol modulo n

20 - DFA based on number of as modulo 3

21 - DFA based on number of as modulo 5

7 - DFA based on cartesian product

22 - DFA 1 on cartesian product

23 - DFA 2 on cartesian product

8 - DFA based on Interpretation of a string as a binary number

24 - DFA based on accepting binary strings which are divisible by 2

25 - DFA based on accepting binary strings which are divisible by 4

26 - DFA based on accepting binary strings which are divisible by 5

9 - DFA based on start symbol end symbol and substring

27 - DFA based on start symbol

28 - DFA based on substring

29 - DFA based on start symbols

30 - DFA based on end symbol

31 - DFA based on end symbols

32 - DFA based on end symbols

33 - DFA based on end symbols

34 - DFA based on substring

35 - DFA based on substring

36 - DFA based on start symbol and end symbol

37 - DFA based on start symbol and end symbol

38 - DFA based on start and end symbol

39 - DFA which accepts strings which starts and ends with different symbols

40 - DFA which accepts strings which starts and ends with the same symbol

10 - Complementation

41 - Complementation of a language

42 - Example 1 on Complementation of a language

43 - Example 2 on complementation of a language

44 - DFA based on following symbol

45 - Complementation of a DFA

46 - Constructing DFA through complementation technique

47 - DFA based on following symbol

48 - DFA based on substring

49 - DFA based on following symbol

50 - DFA based on following symbol

11 - Advanced DFAs

51 - Problem 1

52 - Problem 2

53 - Problem 3

54 - Problem 4

55 - Problem 5

56 - Problem 6

57 - Problem 7

58 - Problem 8

59 - Problem 9

60 - Problem 10

61 - Problem 11

12 - Operations between languages

62 - Union between languages

63 - Problem on Union Operation

64 - Problem on Union Operation

65 - Concatenation between languages

66 - Problem on Concatenation Operation

67 - Reversal of a language

68 - Problem

13 - Bonus How to proceed further

69 - Bonus How to proceed further.html

139,000 تومان

خرید اشتراک افزودن به سبد خرید

خرید دانلودی فوری

در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

تولید کننده: Udemy-Training