Construction of CFG for the given language Examples - part 2 || TOC || Theory of Computation|| FLAT

Поделиться
HTML-код
  • Опубликовано: 17 ноя 2024

Комментарии • 8

  • @dheerajparangot8032
    @dheerajparangot8032 11 месяцев назад +3

    Can we write the production of the last question as: S-> SaS, S->aS/bS/Epsilon ?

    • @SudhakarAtchala
      @SudhakarAtchala  10 месяцев назад +3

      Yes you can. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

  • @vishakt1130
    @vishakt1130 17 дней назад +1

    Can we write aS/bS/epsilon for palindrome???

    • @SudhakarAtchala
      @SudhakarAtchala  8 дней назад

      you can. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

  • @suhas5605
    @suhas5605 2 года назад +1

    sir, what is regular expression for palindrome??

    • @SudhakarAtchala
      @SudhakarAtchala  2 года назад +1

      Refer to other videos of CFG. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

  • @monishaprabhakaran484
    @monishaprabhakaran484 4 месяца назад

    Sir is there a necessary of using all the production rule or we can solve by only 1 pr if possible

    • @SudhakarAtchala
      @SudhakarAtchala  4 месяца назад

      All production rules are needed. Plz subscribe to the channel and if possible share with your friends. Thanks in advance