Register

Recent questions tagged regular-language

0 votes
0 answers
31
Book: Peter Linz, Introduction to Formal Languages and automata, 6th edition, 2017. Chapter2.1 Exercise 17
Can anyone help me in this exercise:Show that the language L = {an : n is a multiple of three, but not a multiple of 5} is regular with DFA.i make DFA but i don’t sure ...
User Avatar
0 votes
1 answer
32
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
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^...
User Avatar
0 votes
1 answer
33
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) .
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
User Avatar
0 votes
1 answer
34
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
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
User Avatar
0 votes
0 answers
37
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
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
User Avatar
0 votes
0 answers
38
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}
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
User Avatar
0 votes
0 answers
39
toc
is it a regular language? why?
is it a regular language? why?
User Avatar
0 votes
1 answer
41
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*)*
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)...
User Avatar
0 votes
0 answers
50
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.
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 ...
User Avatar
2 votes
1 answer
51
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?
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?...
User Avatar
0 votes
1 answer
53
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
User Avatar
Page: