Two finite state machines are said to be equivalent only if

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Two finite state machines are said to be equivalent only if they

Ahave the same number of states

Bhave the same number of edges

Chave the same number of states and also the same number of edges

Drecognise the same set of tokens.

No answer description available for this question. Let us discuss.

View Answer

Discuss

most closely describes the regular expression 01 * 0

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Which statement most closely describes the regular expression 01 * 0 ?

AIt represents a finite set of finite strings

BIt represents an infinite set of finite strings

CIt represents a finite set of infinite strings

DIt represents an infinite set of infinite strings.

Akilesh Kharvi ? Dec 8 '2016 at 21:49

Answer:It represents an infinite set of finite strings

Explanation:

The Regular Expression 01*0 means
The set of ==> {00,010,0110,01110,011110,0111110,01......0, and so on.}
so the length of the string like 00 and 011110 are finite and the set is infinite due to 1*
so the ans is B.

View Answer

Discuss

Which of the following statements is wrong

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Which of the following statements is wrong ?

AAny regular language has an equivalent CFG

BSome non-regular languages cannot be generated by any CFG

CIntersection of a context free language and a regular language is always context free

DAll languages can be generated by CFGs.

No answer description available for this question. Let us discuss.

View Answer

Discuss

The regular expression [ a\b ) { a\b ) denotes the set

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The regular expression [ a\b ) { a\b ) denotes the set

A{ a, b }

B{ a, b, ba, bb}

C{ a, b, ab, aa}

D{ aa, ab, ba, bb }

Akilesh Kharvi ? Dec 8 '2016 at 20:10

Answer: { aa, ab, ba, bb }

Explanation:

There are two sets {a,b},{a,b}
Keep First variable constant then there is two possibility
{aa}{ab}
Keep Second variable constant then there is two possibility
{ba}{bb}
So there is Total Four Possibility {aa,ab,ba,bb}

View Answer

Discuss

P, Q, R are three languages. PQ = R and P and R are regular.

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

P, Q, R are three languages. PQ = R and P and R are regular. This implies

AQ has to be regular

BQ cannot be regular

CQ need not be regular

DQ cannot be a CFL

No answer description available for this question. Let us discuss.

View Answer

Discuss