Discussion Forum

  1. Home
  2. »
  3. Languages
  4. »
  5. Context free language can be...
Context free language can be recognized by

Finite state automation

Linear bounded automation

Push down automata

Both b and c

Answer: D . Both b and c
0Shares
0 0

If you think the posted answer is wrong or Confused About the Answer? Ask for Details Here

Know Explanation? Add it Here
we’ll review your comment and contact you soon….

Leave a Reply

Your email address will not be published. Required fields are marked *

error: You are not allowed to do so.....
0Shares
0
Scroll to Top