Question Discussion & Solution

MCQ

The set of all strings over ? = {a,b} in which all strings of a

a*bbb

(a+b)* bb

All of these

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

All

Programmatic description

Window

Win Object

Collection

Discussion

MCQ

A language is regular if and only if

accepted by DFA

accepted by PDA

accepted by LBA

accepted by Turing machine

Discussion

MCQ

Which of the following pairs of regular expressions are equivalent?

1(01)* and (10)*1

x (xx)* and (xx)*x

x^+ and x^+ x^(*+)

All of the mentioned

Discussion

MCQ

Which of the following is not a regular expression?

[(a+b)*-(aa+bb)]*

[(0+1)-(0b+a1)*(a+b)]*

(01+11+10)*

(1+2+0)*(1+2)*

Discussion

MCQ

Regular expression are

Type 0 language

Type 1 language

Type 2 language

Type 3 language

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 Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

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 Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics