Q:

Context-free grammar (CFG) can be recognized by

mhmadesk

Save to bookmark

|

2022-06-11

|

484

Medium

0

Context-free grammar (CFG) can be recognized by

finite state automata
2 way linear bounded automata
push down automata
both b and c

Operating systems, MCQ Questions, Operating systems MCQ-questions,

login and add your own answer to this question

All Answers

mhmadesk

2022-06-11

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)