menu-iconExamlexExamLexServices

Discover

Ask a Question
  1. All Topics
  2. Topic
    Computing
  3. Study Set
    Theory of Computation
  4. Exam
    Exam 2: Formal Languages and Automata Theory: Part B
  5. Question
    The Following CFG Is in S ? ABB**spaceB ? BAA**spaceA
Solved

The Following CFG Is in S ? ABB**spaceB ? BAA**spaceA

Question 32

Question 32

Multiple Choice

The following CFG is in S ? aBB**spaceB ? bAA**spaceA ? a**spaceB ? b


A) Chomsky normal form but not strong Chomsky normal form
B) Weak Chomsky normal form but not Chomsky normal form
C) Strong Chomsky normal form
D) Greibach normal form

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q27: Which of the following statement is wrong?<br>A)Any

Q28: The language accepted by a Push down

Q29: For two regular languages L<sub>1</sub> = (a

Q30: Which statement is true?<br>A)The PDA must have

Q31: Which of the following problem is undecidable?<br>A)Membership

Q33: Pumping lemma is generally used for proving

Q34: Match all items in Group 1 with

Q35: Consider the following statements<br>I. Recursive languages are

Q36: All NonNull words of the CFL can

Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?

Examlex

ExamLex

About UsContact UsPerks CenterHomeschoolingTest Prep

Work With Us

Campus RepresentativeInfluencers

Links

FaqPricingChrome Extension

Download The App

Get App StoreGet Google Play

Policies

Privacy PolicyTerms of ServiceHonor CodeCommunity Guidelines

Scan To Download

qr-code

Copyright © (2025) ExamLex LLC.

Privacy PolicyTerms Of ServiceHonor CodeCommunity Guidelines