Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-language
0
votes
1
answer
1
Made easy, theory of computaion, Easy level edition 2022
Please explain me why the 4th option is also a true statement.
Please explain me why the 4th option is also a true statement.
RahulVerma3
23
views
RahulVerma3
asked
15 hours
ago
Theory of Computation
regular-language
theory-of-computation
+
–
0
votes
0
answers
2
#toc
Çșȇ ʛấẗẻ
74
views
Çșȇ ʛấẗẻ
asked
Feb 24
Theory of Computation
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
+
–
0
votes
0
answers
3
#TOC
Çșȇ ʛấẗẻ
49
views
Çșȇ ʛấẗẻ
asked
Feb 24
Databases
theory-of-computation
finite-automata
regular-expression
regular-language
+
–
4
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 63
This question concerns two languages over the alphabet $\Sigma=\{1,-1\}$ (note that this is an alphabet with just two symbols: $1$ and $-1 ).$ The two symbols are interpreted, in the natural way, as the numbers $1$ and $-1,$ in ... $\text{L}_1$ Only $\text{L}_2$ Both None
This question concerns two languages over the alphabet $\Sigma=\{1,-1\}$ (note that this is an alphabet with just two symbols: $1$ and $-1 ).$ The two symbols are interpr...
GO Classes
522
views
GO Classes
asked
Jan 13
Theory of Computation
goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-language
2-marks
+
–
0
votes
1
answer
5
What is correct approach to solve such questions ?
ENTJ007
77
views
ENTJ007
asked
Jan 12
Theory of Computation
theory-of-computation
regular-language
+
–
2
votes
1
answer
6
ISRO 2024
Which f the following statements is FALSE? The intersection of a regular language and a context-free language is context=free The intersection of a regular language and context-free language is regular The union of two context-free languages is context-free The union of two regular languages is regular
Which f the following statements is FALSE?The intersection of a regular language and a context-free language is context=freeThe intersection of a regular language and con...
Ramayya
161
views
Ramayya
asked
Jan 7
Theory of Computation
isro-2024
theory-of-computation
context-free-language
regular-language
+
–
0
votes
1
answer
7
Not Regular language [find out]
Why is C is regular as it non regular as? Please help me with this confusion
Why is C is regular as it non regular as?Please help me with this confusion
Deepak9000
201
views
Deepak9000
asked
Nov 27, 2023
Theory of Computation
finite-automata
theory-of-computation
regular-language
+
–
0
votes
0
answers
8
Pumping Lemma
If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails) Can we conversely say for certain if L is not regular, then definitely there is a w’ ∉ L. Simply : Can there be a case where we have all w’ ∈ L and still language is not regular?
If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails)Can we conversely say for certain if L is not regular, then...
Mrityudoot
133
views
Mrityudoot
asked
Nov 8, 2023
Theory of Computation
theory-of-computation
pumping-lemma
regular-language
+
–
3
votes
2
answers
9
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
343
views
Jiten008
asked
Oct 24, 2023
Theory of Computation
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
+
–
0
votes
1
answer
10
#Regular Languages
For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows say a*(b). Will the automaton not ‘hang’ if a string $a^n$ where $n \to$ ∞ is fed to it? Isn’t ‘never accepting but progressing’ the same as hanging?
For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows...
Mrityudoot
319
views
Mrityudoot
asked
Oct 21, 2023
Theory of Computation
theory-of-computation
regular-expression
finite-automata
regular-language
+
–
1
votes
1
answer
11
Checking regularity of a given language.
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$ Is this language regular?
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$Is this language regular?
rexritz
234
views
rexritz
asked
Oct 8, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
1
votes
1
answer
12
Self Doubt from GoClasses Test Series
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L* iii)L^3
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L*iii)L^3
Swarnava Bose
250
views
Swarnava Bose
asked
Aug 26, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
0
votes
1
answer
13
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
Rahhhhhul
839
views
Rahhhhhul
asked
Jun 12, 2023
Theory of Computation
regular-expression
regular-language
regular-grammar
theory-of-computation
+
–
0
votes
0
answers
14
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 ...
Aryam
202
views
Aryam
asked
Jun 8, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
Page:
1
2
3
4
5
6
...
24
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register