Closure Properties of Decidable and Turing recognizable languages

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

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

  • @oogieboo1
    @oogieboo1 2 месяца назад

    For the recognizable languages, kleene star will loop infinitely and fail if you run sequentially if done using your method.

  • @nurbolatkenzhekulov1469
    @nurbolatkenzhekulov1469 4 года назад

    Thank you very much, you helped me a lot! Top quality explanation of all the necessary closures for both types of languages

  • @darkexodus6404
    @darkexodus6404 3 года назад +1

    In the infinite case, why the professor says that the word doesn't belong to the machine? It is undecidable, right? So how can they surely say that word isn't in the language accepted by the machine?

  • @gechtube2828
    @gechtube2828 4 года назад +1

    it is not such amazing