Question Discussion & Solution

MCQ

The length of the shortest string NOT in the language (over ? = {a, b}) of the following regular expression is _____________
a*b*(ba)*a*

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Here is a context-free grammar G: S ? AB A ? 0A1 | 2 B ? 1B | 3A which of the following strings are in L (G)?

021300211

022111300211

None of the mentioned

Both of the mentioned

Discussion

MCQ

The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations.
1. Union

2. Intersection

3. Intersection with a regular language

4. Kleene closure (star)

5. Homomorphism

Inverse homomorphisma) P is not closed under union

NP is not closed under intersection.

None of the mentioned

Both of the mentioned

Discussion

MCQ

RE can be used only for values of type string and number.

True

False

Discussion

MCQ

If a

True

False

Discussion

MCQ

Which one of the following languages over the alphabet {0, 1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

strings with the substring 00

strings with at most two 0

strings with at least two 0

strings beginning and ending with either 0 or 1

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics