Register

AppliedAI - MOCK1

• edited by
1,103 views
0 0 votes
1. If C is any set of regular languages then union C is a regular language

2. Every subset of regular language is regular

3. L = {XYX | X,Y belongs to sigma*} is regular

4. A and B are two Regular languages then A/B {W| W is in A but not in B} is regular

which of the following is true ?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Finding the minimum ...Next → · MadeEasy Subject Tes...
← Previous in category · MadeEasy Full Length...Next in category → · MadeEasy Subject Tes...
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.4k
1.4k views
jatin khachane 1 asked Jan 15, 2019
1,355 views
AppliedAi MOCK1
An I/O device transfers a data 10MB/s over a bus which is capable of sending the data at a rate 100MB/s. Consider a processor operates at 200MHZ, and it takes 100 clock c...
0 0 votes
0 0 answers
2.3k
2.3k views
aambazinga asked Jan 8, 2019
2,319 views
made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring }number of states in the minimal DFA of L’ is?i’m getting 3. please confirm if you are gett...
0 0 votes
1 1 answer
743
743 views
balchandar reddy san asked Jan 19, 2019
743 views
ME mock1
Consider a binary tree, where for every node P – Q ≤ 2, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub t...
0 0 votes
0 0 answers
856
856 views
Prince Sindhiya asked Jan 11, 2019
856 views
gateforum mock1
How to do these type questions step by stepplease help