Recent questions tagged regular-languages

0 votes

1 answer

1

GATEBOOK-2019-TOC1-10
If $L$ is a regular language, which of the following is true? $L' = \{x_1x_3x_5 \ldots \mid x_0x_1x_2x_3x_4 \ldots \in L\}$ is non - regular $L'' = \{x_0x_2x_4 \ldots \mid x_0x_1x_2x_3x_4 \ldots \in L\}$ is non - regular Both $L'$ and $L''$ are non-regular Both $L'$ and $L''$ are regular

asked 6 days ago in Theory of Computation by GATEBOOK Active (1.8k points) | 43 views

0 votes

0 answers

2

GATEBOOK-2019-TOC1-16
Consider the DFA with states $\{0,1,2,3,4\},$ input alphabet set $\{0.1\},$ start state $0,$ final state $0,$ and transition function $\delta \left ( q,i \right ) = (q^2-i) \mod 5 \mid i \in\{0,1\}. $The language ... Set of binary strings containing odd number of 0's Set of binary strings containing even number of 1's Set of binary strings containing odd number of 1's

asked 6 days ago in Theory of Computation by GATEBOOK Active (1.8k points) | 8 views

+1 vote

1 answer

3

GATEBOOK-2019-TOC1-20
Let $L_1 = a^*b^*$ and $L_2 = \{ab\}.$ $L_3 = \text{Prefix}(L_1^* \cap L_2),$ where $\text{Prefix}(L) = \{u \mid uv \in L$ for some $v\}.$ Number of strings in $L_3$ is _______

asked 6 days ago in Theory of Computation by GATEBOOK Active (1.8k points) | 36 views

0 votes

0 answers

4

RE for given FA
The correct regular expression for the below mentioned Finite Automata Do we have to have ca* as C is dead state,does dead state be a part of regular expression? The expression I am gettting is c*a(d*+ba*) as C state is dead state hence no need to consider it.Please Correct me.

asked Nov 6 in Theory of Computation by sripo Junior (751 points) | 28 views

0 votes

1 answer

5

Are these two languages equal?
L1=ab* L2=a(aa)*b(bb)* Are the languages equal if not what relation do they satisfy?

asked Nov 6 in Theory of Computation by sripo Junior (751 points) | 23 views

0 votes

0 answers

6

Made Easy Test Series
I think, my answer is right. Please note that S2 says about two different languages.

asked Nov 2 in Theory of Computation by Harsh Kumar Junior (803 points) | 19 views

0 votes

1 answer

7

Testbook chapter test
Is L={1n0n0m | m+n>100} a regular language?

asked Oct 30 in Theory of Computation by CS.user (69 points) | 79 views

0 votes

1 answer

8

Regular Language and Ambiguity
For every regular grammar, we can always have an unambigious grammar?

asked Oct 29 in Theory of Computation by smsubham Loyal (8.1k points) | 37 views

0 votes

0 answers

9

Ace Book

asked Oct 28 in Theory of Computation by abhishek1995_cse (155 points) | 26 views

0 votes

0 answers

10

own doubt
can we say that every regular language is a DCFL?

asked Oct 27 in Theory of Computation by sudharshan (107 points) | 34 views

0 votes

1 answer

11

Ace book
The minimal finite automata accepting the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states. The ans is 7 but according to me modulo n has 5 states .?

asked Oct 22 in Theory of Computation by abhishek1995_cse (155 points) | 31 views

0 votes

2 answers

12

TOC Regular Langauges
Is L= 0n1| n>=0 regular? Is the kleene closure i.e. (L)* regular?

asked Oct 18 in Theory of Computation by sakharam Active (2.4k points) | 161 views

0 votes

0 answers

13

To test if the given language is regular.

asked Oct 16 in Theory of Computation by sripo Junior (751 points) | 69 views

0 votes

0 answers

14

Can a^p where p is a prime number be an NFA?

asked Oct 16 in Theory of Computation by sripo Junior (751 points) | 69 views

0 votes

0 answers

15

TOC Self Doubt
If L1 is CFL and L2 is Regular L. $L1\cap L2 = L3$ Then L3 is CFL. Can L3 be regular also sometimes and if L3 is CFL and Regular also does it employs L1 is also Regular ??

asked Oct 14 in Theory of Computation by jatin khachane 1 Active (1.7k points) | 38 views

0 votes

0 answers

16

Regular Languages
Which is the equivalent Regular Expression for the following: "Strings in which every group of 3 symbols should contain atleast 1 a." a)[(a+b) (a+b)a]* b) [(a+b) (a+b)a]* [(a+b)(a+b)a]* c)[(ϵ + b + bb)a]* [ ϵ+ b + bb] d) (abb)* (bab)b* (bba)*

asked Oct 14 in Theory of Computation by Sambhrant Maurya Junior (899 points) | 38 views

0 votes

0 answers

17

Formal Languages
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)? a) L[b*ab*ab*ab*)*] b) L[b*ab*ab*)*] c) L[b*ab*ab*)6] d) L[b*ab*ab*ab*ab*ab*ab*)*]

asked Oct 14 in Theory of Computation by Sambhrant Maurya Junior (899 points) | 44 views

0 votes

0 answers

18

Formal Languages
Let r1= (a+b2)* , r2 = (a* + b*)* , r3 = (a2 + b)* Which of the following is true? a)L(r1) is a subset of L(r2) and L(r3) is a subset of L(r2) b)L(r2) is a subset of L(r1) and L(r2) is a subset of L(r3) c)L(r1) = L(r3) is a subset of L(r2) d) L(r1) U L(r3) = L(r2)

asked Oct 14 in Theory of Computation by Sambhrant Maurya Junior (899 points) | 28 views

+1 vote

0 answers

19

Subset of a regular language
Let L be a regular language over {a,b}, Suppose a new language defined as follows, L = x1 , x2, x3, x4,........ L1 = x5, x10, x15 ..... L1 is defined as taking every string which is at positon 5, 10, 15 and so on, in other words, the positions that can be divided by 5. Is L1 regular?

asked Oct 13 in Theory of Computation by AnilGoudar Active (4.6k points) | 18 views

0 votes

1 answer

20

Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*

asked Oct 10 in Theory of Computation by sripo Junior (751 points) | 56 views

0 votes

0 answers

21

Equivalence of regular expressions
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it just worked for this case?

asked Oct 10 in Theory of Computation by sripo Junior (751 points) | 29 views

0 votes

2 answers

22

Regular Languages
Why is WXWR a regular language but XWWR is not? (X,W ϵ (0,1)+)

asked Oct 1 in Theory of Computation by Sambhrant Maurya Junior (899 points) | 46 views

0 votes

2 answers

23

Regular Languages
Why is ambn / m,n>=1 a regular language but anbn / n>=1 not?

asked Oct 1 in Theory of Computation by Sambhrant Maurya Junior (899 points) | 44 views

0 votes

1 answer

24

Madeeasy workbook
Why this language is regular ? And answer to this question ?

asked Sep 30 in Theory of Computation by Arjun045 (9 points) | 18 views

0 votes

1 answer

25

Peter Linz
Find regular expressions for the following languages on {a, b}. (a) L = {w : |w| mod 3 = 0} (b) L = {w : na (w)mod 3 = 0} (c) L = {w : na (w)mod 5 > 0} Also Design DFA for the same.

asked Sep 27 in Theory of Computation by Karan Dodwani 1 (63 points) | 58 views

0 votes

2 answers

26

TOC (Regular expression)
Given two Regular expressions are equal or not ? 1) (1+01*0)* 2) 1*(01*0)* 1* Give proper explanation also.

asked Sep 27 in Theory of Computation by Ashish Roy 1 (83 points) | 94 views

0 votes

0 answers

27

selfdoubt
if concatenation of two languages $L_1\ and\ L_2(L_1.L_2)$ is regular then what can we say about $L_1\ and\ L_2 $ ?? is there any possibility of $L_1=nonregular\ ,\ L_2=nonregular \ $ ??

asked Sep 18 in Theory of Computation by Prateek Raghuvanshi Loyal (6.8k points) | 104 views

0 votes

0 answers

28

Peter linz
From a language L we create a new language chop2 (L)by removing the two leftmost symbols of every string in L. Specifically, chop2(L) = {w: vw ∈ L, with |v|= 2}. Show that if L is regular, then chop2 (L) is also regular.

asked Sep 14 in Theory of Computation by vaibhav singh 3 (55 points) | 41 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged regular-languages

Recent Posts

Recent Blog Comments