Q:

Context free language can be recognized by

belongs to collection: SYSTEMS PROGRAMMING LANGUAGES MCQ

0

Context free language can be recognized by


  1. finite state automation
  2. linear bounded automation
  3. push down automata
  4. both b and c

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

 (d).both b and c

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

SYSTEMS PROGRAMMING LANGUAGES MCQ

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
Which is not true about syntax and semantic parts ... >>
<< Which of the following is most general phase struc...