Which of the following problems is undecidable?
equivalence of Regular languages is decidable.
All are decidable for Regular languages.
First 3 for CFL.
Only 1st for CSL and REC.
None for RE.
So option B will be correct one.
How many child processes will be created for...
solutions for answers are not given...