Recent questions tagged regular-languages

0 votes

0 answers

1

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 6 days ago in Theory of Computation by Prateek Raghuvanshi Loyal (5.8k points) | 89 views

0 votes

0 answers

2

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) | 21 views

+2 votes

2 answers

3

Regular Language
Is the given Grammer represent a regular language ? S->AaB A->aC | epsilon B->aB | bB | epsilon C->aCb | epsilon

asked Sep 13 in Theory of Computation by Na462 Loyal (5.7k points) | 53 views

0 votes

1 answer

4

Doubt in regular expressions
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.

asked Sep 12 in Theory of Computation by goluabhinan (77 points) | 41 views

+1 vote

1 answer

5

Regular language identification
Is Language L = {0(n+m) 1(k+l) | m = l, and m,n,k,l ≥ 1 } a regular language ? explain

asked Sep 11 in Theory of Computation by Na462 Loyal (5.7k points) | 75 views

0 votes

0 answers

6

Pumping lemma
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular language in pumping lemma?

asked Sep 9 in Theory of Computation by aambazinga Junior (985 points) | 11 views

+1 vote

1 answer

7

test series
If L1 and L2 are non-regular, then L1 ⋃ L2 is also non-regular. state the above statement is true or false?

asked Sep 3 in Theory of Computation by navya n (339 points) | 33 views

0 votes

1 answer

8

Regular Language
Ans. 48

asked Sep 2 in Theory of Computation by Na462 Loyal (5.7k points) | 59 views

+1 vote

0 answers

9

Regular expression
Ans. B

asked Sep 2 in Theory of Computation by Na462 Loyal (5.7k points) | 38 views

0 votes

1 answer

10

Regular Expression
Check the Language is Regular or Not? WXWR (W,X ∈ (0,1)+) Please Explain.

asked Aug 31 in Theory of Computation by CHIRAG CHAWLA (75 points) | 34 views

0 votes

2 answers

11

Self doubt, Automata theory
Suppose ∑* over {a,b,c} , whether it is regular or not ? If yes then will it contain this language or not { an . bn . cn | n > 0 } ? If yes then how is sigma* regular ? I am in great confusion plz help.

asked Aug 30 in Theory of Computation by Shashi Shekhar 1 (131 points) | 22 views

+1 vote

1 answer

12

Regular Expression
Ans. C

asked Aug 30 in Theory of Computation by Na462 Loyal (5.7k points) | 32 views

0 votes

1 answer

13

Self Doubt in checking whether a language is regular or not

asked Aug 17 in Theory of Computation by rohan.1737 (81 points) | 49 views

0 votes

1 answer

14

Regular languages
Kindly give the reason behind 2 and 3?

asked Aug 17 in Theory of Computation by Ajit J (57 points) | 44 views

0 votes

0 answers

15

TOC - Doubt
The logic of pumping leema is good example of The Pigeon Hole Principle. Can anyone please explain this?

asked Aug 15 in Theory of Computation by Sumit Singh Chauhan Active (1.3k points) | 8 views

0 votes

1 answer

16

TOC - Doubt
As we know that the regular languages are closed under complement. That means if L is regular than it's complement will also be regular. What about the non regular languages? Are they closed under complement? Can we say that if L is non regular than it's complement will also be not regular? Please explain.

asked Aug 15 in Theory of Computation by Sumit Singh Chauhan Active (1.3k points) | 17 views

0 votes

0 answers

17

Curiousity
In an intersection between a regular language and a DCFL, we always tend to promote regular language to DCFL and say that the result will be intersection between DCFL and DCFL but since DCFLs are not closed under intersection we say the result will be a CFL. But ... which is not DCFL Can you write a language which is an intersection between a DCFL and a regular language but not a DCFL.

asked Aug 12 in Theory of Computation by Vikas Verma Active (1.4k points) | 57 views

0 votes

1 answer

18

Regular Language

asked Aug 12 in Theory of Computation by jatinkumar (219 points) | 69 views

0 votes

0 answers

19

TOC, RL
Consider the following S1: Pumping lemma is used to prove, that particular language is not regular S2: For all DCFL there exist LR(k) grammar but LL(k) may not exist. Which of the above statements are true? (a) Only S1 (b) Only S2 (c) Only S1 and S2 (d) None of these

asked Aug 10 in Theory of Computation by manisha11 Junior (833 points) | 25 views

0 votes

2 answers

20

TOC, RL
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Language L is regular. S2: Complement of L is CFL. S3: Complement of L is CSL. S4: Reversal of L is CFL.

asked Aug 10 in Theory of Computation by manisha11 Junior (833 points) | 37 views

0 votes

0 answers

21

Regular language
$L=\left \{ a^{n}:\text{n is the product of two prime number} \right \}$$L$ is regular or non regular?

asked Aug 3 in Theory of Computation by saumya mishra Active (1.3k points) | 59 views

0 votes

0 answers

22

#Regular Language
Consider the set of all words over the alphabet {x, y, z} where the number of y’s is not divisible by 2 or 7 and no x appears after a z. This language is: (A) regular (B) not known to be regular (C) context-free but not regular (D) recursively enumerable but not context-free

asked Jul 30 in Theory of Computation by himgta Active (1.6k points) | 28 views

0 votes

1 answer

23

theory of computation
check whether given language is regular or not 1) (an) n where n ≥1 2) ( am ) n where n ≥ 1 3) w= { (( a 2 ) n) * (( an )2 )* } where n ≥ 1

asked Jul 24 in Theory of Computation by Rahul_Rathod_ (381 points) | 92 views

0 votes

2 answers

24

theory of computation
{ W X Wr | w,x ∈ (a+b)+ } this language is regular....how?

asked Jul 24 in Theory of Computation by Rahul_Rathod_ (381 points) | 70 views

0 votes

2 answers

25

Regular language
A^n | n>=1 In this language 'n' is unbounded so I want to understand why it comes under finite automata as language is infinite. As finite automata has finite memory. Please suggest Thanks Mayank

asked Jul 17 in Theory of Computation by Mayankprakash (427 points) | 50 views

0 votes

2 answers

26

Doubt Regular Language and regular expressions

asked Jul 16 in Theory of Computation by abhiram144 (61 points) | 91 views

0 votes

1 answer

27

GATE - TOC Regular Languages & FA
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)? a) (b*ab*ab*ab*)* b) (b*ab*ab*)* c) (b*ab*ab*)^6 d) (b*ab*ab*ab*ab*ab*ab*)* Please do explain also.

asked Jul 15 in Theory of Computation by Ashish Roy 1 (35 points) | 91 views

+1 vote

2 answers

28

Languages
Consider a language over Σ={a,b} the description of L is given below. L={ PQ | P ∈(a,b)* , Q ∈ (a,b)* and na(P) = nb(Q) }. Select the correct option. 1. L is DCFL but not regular. 2. L is CSL but not CFL. 3. L is CFL but not DCFL. 4. None of these.

asked Jul 3 in Theory of Computation by Priyansh Singh (115 points) | 101 views

0 votes

1 answer

29

Simplifying regular expressions
What is regex for the DFA: I am coming up with following two: 1. b*a(a+b)* and 2. b*a(b+ab*a)*+b*ab*a(ab*a+b)* Both seems to be correct to me. For X1, we have regex b*a(b+ab*a) For X2, we have regex b*ab*a(ab*a ... question: I want to know if I can simplify regex 2 to regex 1 by regex identities, but not by any other approach say by dfa minimization. Is it possible?

asked Jul 1 in Theory of Computation by GateAspirant999 Active (2.7k points) | 105 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