Which among the following looks similar to the given express...

MCQ

Which among the following looks similar to the given expression?((0+1). (0+1)) *

{x? {0,1} *|x is all binary number with even length}

{x? {0,1} |x is all binary number with even length}

{x? {0,1} *|x is all binary number with odd length}

{x? {0,1} |x is all binary number with odd length}

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The production Grammar is {S->aSbb,S->abb} is

Type-3 grammar

Type-2 grammar

Type-1 grammar

Type-0 grammar

Discussion

MCQ

How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Discussion

MCQ

Which of the following is/are the suitable approches for inferencing?

Recursive Interference

Derivations

Both Recursive Interference and Derivations

None of the mentioned

Discussion

MCQ

Which of the following pair of regular expression are not equivalent?

1(01)* and (10)*1

x(xx)* and (xx)*x

(ab)* and a*b*

x+ and x*x+

Discussion

MCQ

An FSM with

M can be transformed to Numeral relabeling its states

M can be transformed to N, merely relabeling its edges

Both of the mentioned

None of the mentioned

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