Topper's Wisdom Choice Education
Topper's Wisdom Choice Education
  • Видео 14
  • Просмотров 1 897
Design DFA that accepts strings that ends in either 101 or 100Over ∑ = {0, 1}.
Design DFA that accepts strings that ends in either 101 or 100Over ∑ = {0, 1}.
Просмотров: 109

Видео

Give regular expression for the given transition diagram. (Using Arden's Theorem)#shortfeed4:23Give regular expression for the given transition diagram. (Using Arden's Theorem)#shortfeed
Give regular expression for the given transition diagram. (Using Arden's Theorem)#shortfeed
Просмотров 144Месяц назад
Give regular expression for the given transition diagram. (Using Arden's Theorem)#shortfeed
Set of all strings that contain even number of a's over {a,b}.1:57Set of all strings that contain even number of a's over {a,b}.
Set of all strings that contain even number of a's over {a,b}.
Просмотров 98Месяц назад
Set of all strings that contain even number of a's over {a,b}.
Design a DFA that accepts strings that contain "ab" and "ba" as suffix.1:55Design a DFA that accepts strings that contain "ab" and "ba" as suffix.
Design a DFA that accepts strings that contain "ab" and "ba" as suffix.
Просмотров 288Месяц назад
Design a DFA that accepts strings that contain "ab" and "ba" as suffix.
Design a PDA for recognizing language L = {0 n 1 2n | n greater than equal to 1}5:06Design a PDA for recognizing language L = {0 n 1 2n | n greater than equal to 1}
Design a PDA for recognizing language L = {0 n 1 2n | n greater than equal to 1}
Просмотров 142Месяц назад
Design a PDA for recognizing language L = {0 n 1 2n | n greater than equal to 1}
Construct a PDA for accepting L = {a n b m a n | m, n greater than equal to 1}8:04Construct a PDA for accepting L = {a n b m a n | m, n greater than equal to 1}
Construct a PDA for accepting L = {a n b m a n | m, n greater than equal to 1}
Просмотров 174Месяц назад
Construct a PDA for accepting L = {a n b m a n | m, n greater than equal to 1}
Using pumping lemma prove that the language L = {0 m 1 m+1 | m greater than 0} is not regular.8:53Using pumping lemma prove that the language L = {0 m 1 m+1 | m greater than 0} is not regular.
Using pumping lemma prove that the language L = {0 m 1 m+1 | m greater than 0} is not regular.
Просмотров 329Месяц назад
Using pumping lemma prove that the language L = {0 m 1 m 1 | m greater than 0} is not regular.
Explain finite automata and its type...4:23Explain finite automata and its type...
Explain finite automata and its type...
Просмотров 93Месяц назад
Explain finite automata and its type...
Design a finite automata whose length is greater than equal to 3 and 3rd symbol will always be 1.1:28Design a finite automata whose length is greater than equal to 3 and 3rd symbol will always be 1.
Design a finite automata whose length is greater than equal to 3 and 3rd symbol will always be 1.
Просмотров 59Месяц назад
Design a finite automata whose length is greater than equal to 3 and 3rd symbol will always be 1.
Design a DFA that will accept strings that start or end with 01.2:14Design a DFA that will accept strings that start or end with 01.
Design a DFA that will accept strings that start or end with 01.
Просмотров 106Месяц назад
Design a DFA that will accept strings that start or end with 01.
Design a finite automata that will accept strings if it starts with either 011 or 100 only.3:06Design a finite automata that will accept strings if it starts with either 011 or 100 only.
Design a finite automata that will accept strings if it starts with either 011 or 100 only.
Просмотров 90Месяц назад
Design a finite automata that will accept strings if it starts with either 011 or 100 only.
Design a finite automata that will start with 0 and odd length or start with 1 and even length.2:15Design a finite automata that will start with 0 and odd length or start with 1 and even length.
Design a finite automata that will start with 0 and odd length or start with 1 and even length.
Просмотров 215Месяц назад
Design a finite automata that will start with 0 and odd length or start with 1 and even length.

Комментарии

  • @NidaInamdar-e8f
    @NidaInamdar-e8f Месяц назад

    Design a TM accepting all palindrome over {0,1}

  • @jarvisgaming77
    @jarvisgaming77 Месяц назад

    Sir please make video on moore and mealy machine designing problems

  • @Oggang-g5f
    @Oggang-g5f Месяц назад

    Thank you sir

    • @topperswisdomchoiceeducati5459
      @topperswisdomchoiceeducati5459 Месяц назад

      @@Oggang-g5f 👍Always welcome. If you need any specific video, message me here or send the questions through whatsapp @9871262047

  • @Oggang-g5f
    @Oggang-g5f Месяц назад

    Sir please make a video on PDA

  • @jeeshu_editz5377
    @jeeshu_editz5377 Месяц назад

    East or west Navin Sir is best ❤

    • @topperswisdomchoiceeducati5459
      @topperswisdomchoiceeducati5459 Месяц назад

      @@jeeshu_editz5377 If you need any specific video, message me here or send the questions through whatsapp @9871262047

  • @kartikpudari3240
    @kartikpudari3240 Месяц назад

    Thanks, Sir, for simplifying the FA sum! Really helpful for understanding the concept.

    • @topperswisdomchoiceeducati5459
      @topperswisdomchoiceeducati5459 Месяц назад

      @kartikpudari3240 Always welcome. If you need any specific video, message me here or send the questions through whatsapp @9871262047