The Gateway to Computer Science Excellence
+2 votes
55 views

Say that a $CFG$ is minimal if none of its rules can be removed without changing the language generated. Let $MIN_{CFG} = \{\langle G \rangle \mid \text{G is a minimal CFG}\}$.

  1. Show that $MIN_{CFG}$ is $T-$recognizable.
  2. Show that $MIN_{CFG}$ is undecidable.
in Theory of Computation by Veteran (54.8k points) | 55 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,508 answers
195,519 comments
100,950 users