Q:

Context-free grammar (CFG) can be recognized by

belongs to collection: SYSTEMS PROGRAMMING LANGUAGES MCQ

0

Context-free grammar (CFG) can be recognized by


  1. finite state automata
  2. 2 way linear bounded automata
  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
Indicate which of the following is not true about ... >>
<< Any syntactic construct that can be described by a...