Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-expression
0
votes
1
answer
31
Theory of Computation
Convert the following DFA to a regular expression:
Convert the following DFA to a regular expression:
gateexplore
838
views
gateexplore
asked
Jun 11, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
32
Theory of computation
Design a DFA corresponding to regular expression 1*(10)*
Design a DFA corresponding to regular expression 1*(10)*
gateexplore
780
views
gateexplore
asked
Jun 11, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
33
Regular expression Theory of Computation
Answer this
Answer this
Snehil01
461
views
Snehil01
asked
May 27, 2023
Theory of Computation
theory-of-computation
regular-expression
regular-grammar
+
–
0
votes
1
answer
34
DFA to Regular Expression
Çșȇ ʛấẗẻ
413
views
Çșȇ ʛấẗẻ
asked
May 10, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
35
Regular Expression
can you help me in question my answer is b it's correct or not, or where I'm wron Caption
can you help me in question my answer is b it's correct or not, or where I'm wron Caption
Samridh28
209
views
Samridh28
asked
May 9, 2023
Theory of Computation
made-easy-booklet
theory-of-computation
regular-expression
+
–
0
votes
1
answer
36
Can someone help me for better understanding.
Tarungujral89
286
views
Tarungujral89
asked
May 4, 2023
Theory of Computation
theory-of-computation
regular-expression
number-of-dfa
+
–
1
votes
2
answers
37
Design a DFA from the given RE [ a (a* ba* ba*) * ]
manjula66
617
views
manjula66
asked
Apr 15, 2023
Compiler Design
regular-expression
finite-automata
+
–
0
votes
1
answer
38
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) .
upasesharanesh
331
views
upasesharanesh
asked
Apr 6, 2023
Theory of Computation
finite-automata
regular-language
regular-expression
strings
+
–
11
votes
4
answers
39
GATE CSE 2023 | Question: 4
Consider the Deterministic Finite-state Automaton ($\text{DFA}$) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$, and has the set of states $\{s, p, q, r\}$, with $s$ being the start state and $p$ being the only final state. Which one of the following ... $1\left(0^{*} 11\right)^{*}$ $0(0+1)^{*}$ $1(0+11)^{*}$ $1\left(110^{*}\right)^{*}$
Consider the Deterministic Finite-state Automaton ($\text{DFA}$) $\mathcal{A}$ shown below. The $\text{DFA}$ runs on the alphabet $\{0,1\}$, and has the set of states $\{...
admin
11.0k
views
admin
asked
Feb 15, 2023
Theory of Computation
gatecse-2023
theory-of-computation
regular-expression
1-mark
+
–
8
votes
4
answers
40
GATE CSE 2023 | Question: 9
Consider the following definition of a lexical token $\textbf{id}$ for an identifier in a programming language, using extended regular expressions: \[ \begin{array}{ll} \textbf{ letter } & \rightarrow[\mathrm{A}-\mathrm{Za}-\mathrm{ ... Finite-state Automata with $\epsilon$-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)
Consider the following definition of a lexical token $\textbf{id}$ for an identifier in a programming language, using extended regular expressions:\[\begin{array}{ll}\tex...
admin
8.4k
views
admin
asked
Feb 15, 2023
Theory of Computation
gatecse-2023
theory-of-computation
regular-expression
1-mark
+
–
1
votes
2
answers
41
GATE CSE 2023 | Memory Based Question: 25
Consider the following finite automata and find the correct regular expression. $0(0+11)^*$ $1(0+11)^*$ $1(0 * 11)^*$ $0\left(0^* 11\right)^*$
Consider the following finite automata and find the correct regular expression.$0(0+11)^*$$1(0+11)^*$$1(0 * 11)^*$$0\left(0^* 11\right)^*$
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Theory of Computation
memorybased-gatecse2023
goclasses
theory-of-computation
regular-expression
+
–
1
votes
1
answer
42
Regular expression
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?
mo7ammedfarooq
362
views
mo7ammedfarooq
asked
Jan 16, 2023
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
1
answer
43
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)...
M_Umair_Khan42900
743
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
regular-expression
finite-automata
+
–
1
votes
1
answer
44
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
M_Umair_Khan42900
2.1k
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
+
–
0
votes
1
answer
45
find all strings of lenght 4 less, for the following regular expression (a*b + b*a)
Hemant jha
701
views
Hemant jha
asked
Dec 25, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
0
votes
3
answers
46
theory regular langauge
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
moe12leb
656
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
1
votes
0
answers
47
Theroy regular langauge
Write a regular expression for all strings of 0’s and 1’s in which at least one copy of the substring 01 occurs before any copy of the substring 10 occurs in the string. If there is no occurrence of the substring 10 then there need not be any copy of the substring 01.
Write a regular expression for all strings of 0’s and 1’s in which at least one copy of the substring 01 occurs before any copy of the substring 10 occurs in the stri...
moe12leb
199
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
0
votes
1
answer
48
theory Regular Langauge
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
moe12leb
233
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
0
votes
3
answers
49
#selfDoubt
what will be the DFA for RE – (a*ba)*
what will be the DFA for RE – (a*ba)*
Dknights
486
views
Dknights
asked
Nov 9, 2022
Theory of Computation
theory-of-computation
regular-expression
+
–
Page:
« prev
1
2
3
4
5
6
7
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register