Finite Automata and Regular Expressions MCQ

Test your knowledge with important Finite Automata and Regular Expressions MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Finite Automata and Regular Expressions MCQs on Bissoy. Bissoy App

• Which one of the following statement is FALSE?
  ক

  Context-free languages are closed under union

  খ

  Context-free languages are closed under concatenation

  গ

  Context-free languages are closed under intersection

  ঘ

  Context-free languages are closed under Kleene closure