## Design a NFA that accepts the language over the alphabet, Σ= {0, 1,2} where the decimal equivalent of the language is divisible by 3.

RGPV 2022 PYQ

RGPV 2020    Find the grammar in Chomsky Normal form equivalent to S–>aAD;A->aB/bAB;B->b,D->d. Ans. A context free grammar (CFG) is said to be in chomsky … Read more

## NDFA accepting two consecutive a’s or two consecutive b’s.

RGPV 2020Construct a NDFA accepting all string in {a,b} with either two consecutive a’s or two consecutive b’s. Ans.

## Regular expresion to CFG

To convert a regular expression to a context-free grammar (CFG), you can follow a set of standard conversion rules. Here are the rules for converting … Read more

## Regular expression to Regular grammar

RGPV 2020   How can we construct regular grammar from regular expression?  Ans. Lets take an regular expresion example: 0*(1(0+1))* Now convert above example in to … Read more

## Grammar is ambiguous. S → aSbS|bSaS|∈

RGPV 2020 Show that the following grammar is ambiguous.  S → aSbS|bSaS|∈ Ans. For grammar to be ambiguous, there should be more than one parse … Read more

## leftmost and rightmost derivations

RGPV 2020    What are leftmost and rightmost derivations? Explain with suitable example ? Grammar: S → aS / ∈ For generating strings ‘aaa’. Left … Read more

## Construct Moore machine for Mealy machine

RGPV 2020Construct Moore machine for the following Mealy machine. Sol. Transition table for above Mealy machine. Present State Next State Input = 0 Input = … Read more

## CFL are not closed under intersection

RGPV 2020    Preve that CFL are not closed under intersection ? If L1 and If L2 are two context free languages, their intersection L1 … Read more

## DFA end with 1 contain 00 | RGPV TOC draw

RGPV 2007 Q. Define deterministic finite automta. Draw DFA that accepts any string which ends with 1 or it ends with an even number of … Read more