Is the following set Countable or Uncountable?

StackOverflow https://stackoverflow.com/questions/19892328

  •  30-07-2022
  •  | 
  •  

Question

Is the set of all context free grammars with exactly the terminals {0,1,2} and exactly the non-terminals {S,T,R} countable or uncountable? Is it infinite?

Was it helpful?

Solution

As Zack answered in the comments above it is a set of all Turing Machines therefore it can not be any more than countably infinite.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top