Dark Mode

Recent questions tagged regular-language

0 votes

0 answers

1

Finite number of equivalence classes meaning
A "finite number of equivalence classes" means that there are a countable, limited number of different groups, or classes, when an equivalence relation is applied to a set. In terms of formal languages, if you apply the ... of equivalence classes (specifically two in this case), this language is regular according to the Myhill-Nerode theorem.

dhruba asked in Theory of Computation May 24

by dhruba

20 views

0 votes

0 answers

2

Myhill Nerode and right invariant equivalence relation
The Myhill-Nerode Theorem is a fundamental theorem in formal language theory that provides a unique characterization of regular languages. Regular languages are recognizable by finite automata and have equivalent representations ... the right invariant equivalence relation, proving the theorem's practical utility in formal language theory.

dhruba asked in Theory of Computation May 24

by dhruba

11 views

0 votes

1 answer

3

TOC Query
For $S \rightarrow 0S1 | \epsilon$ for $\sum=\{0,1\}^*$, which of the following is wrong for the language produced? (a) Non regular language (b) $0^n1^n | n\geq0$ (c) $0^n1^n | n\geq1$ (d) None of the mentioned

Mani Kanta seela asked in Theory of Computation May 3

by Mani Kanta seela

117 views

0 votes

1 answer

4

Finite automata and formal languages
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .

upasesharanesh asked in Theory of Computation Apr 6

by upasesharanesh

125 views

0 votes

1 answer

5

Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none

practicalmetal asked in Theory of Computation Mar 26

by practicalmetal

126 views

0 votes

0 answers

6

#TIFR
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is, $\sum^* - \text{ L}$ is denoted by $L'$. Which of the following is ... d) $L$ is a context-free language and $L'$ is not a context-free language. (e) Neither is $L$ a context-free language nor is $L'$ a context-free language.

amit166 asked in Theory of Computation Feb 13

122 views

0 votes

0 answers

7

An Introduction to Formal Languages and Automata,Peter Linz,6th edition,exercise 3.3 q3
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).

Silver_Reaper asked in Theory of Computation Feb 6

by Silver_Reaper

179 views

0 votes

0 answers

8

Made Easy Gate Mock -1
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d

TusharKumar asked in Theory of Computation Jan 21

127 views

0 votes

0 answers

9

derive a language from a grammar
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}

moe12leb asked in Theory of Computation Jan 21

94 views

0 votes

0 answers

10

toc
is it a regular language? why?

someshawasthi asked in Theory of Computation Jan 17

by someshawasthi

122 views

0 votes

1 answer

11

is (a , b)* and (a*b*) are same ?

Mikdhad asked in Theory of Computation Jan 14

148 views

0 votes

1 answer

12

Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

270 views

0 votes

1 answer

13

Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

120 views

0 votes

0 answers

14

For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

97 views

0 votes

1 answer

15

Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False

Souvik33 asked in Theory of Computation Dec 27, 2022

209 views

0 votes

0 answers

16

Show that the language L = {an : n ≥ 0, n != 3} is regular.

tesfaye asked in Theory of Computation Dec 19, 2022

147 views

0 votes

2 answers

17

Every Regular language has an equivalent NFA ?? True/False

R ji asked in Theory of Computation Dec 15, 2022

by R ji

248 views

0 votes

1 answer

18

could you help me with this made easy question?
I tried to solve but got stuck here.

farmanahmed888 asked in Theory of Computation Dec 14, 2022

by farmanahmed888

197 views

2 votes

0 answers

19

#Self Doubt
Suppose L1 = CFL and L2 = Regular, We are to find out whether L1 - L2 = CFL or non CFL. I have 2 approaches to this question and I am confused which is wrong: L1 - L2 = L1 intersection L2' L2 being Regular L2' is also Regular so CFL ... being Regular L2' is also Regular and every Regular Language is also CFL so CFL intersection CFL = non CFL. Can somebody please clarify my doubt?

Sunnidhya Roy asked in Theory of Computation Dec 11, 2022

by Sunnidhya Roy

145 views

0 votes

0 answers

20

This question is from introduction to formal language and automata peter linz 5th edition

Hafeezullah asked in Theory of Computation Dec 2, 2022

13 views

0 votes

0 answers

21

Made easy Theory of Computation
Which of them are not regular- (a) L={a^m b^n | n>=2023, m<=2023} (b) L={a^n b^m c^l | n=2023, m>2023, l>m} according made easy (b) is the answer but can we do like this- Let L1= {a^n |n=2023} ... ) and so L2 is regular L=L1.L2 (regular lang are closed under concatenation) therefore L is regular.this makes option (b) regular is it right approach ?

Shreya2002 asked in Theory of Computation Dec 2, 2022

168 views

0 votes

0 answers

22

Toc-Self Doubt
Can anyone explain what is the meaning of saying set of some languages is another language. Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which is set of languages . If i say L is regular Does it mean L1,l2,l3...Ln are regular.

vishnu777 asked in Theory of Computation Nov 24, 2022

89 views

1 vote

1 answer

23

Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?

Pranavpurkar asked in Theory of Computation Nov 11, 2022

by Pranavpurkar

187 views

Page:

1
2
3
4
5
6
...
23
next »

Recent questions tagged regular-language