Today I Learned

Some of the things I've learned every day since Oct 10, 2016

27: 2 Undecideable Problems in Context-Free Grammars

A couple undecideable problems regarding context-free grammars:

  1. Equality: Given 2 distinct CFGs, do they produce/describe the same language?
  2. Disjointness: Again given 2 distinct CFGs, is there any string which can be produced by both?
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: