Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged regular-expression
0
votes
0
answers
1
Convert the following Regular Expression to DFA using the Direct Method r = ( a | b ) * a ( a | b ) ( a | b ) a. Write the Augmented Regular Expression b. Construct the Syntax Tree for the Augmented Regular Expression c. Calculate nullable( ), firstpos( ), lastpos( ) for all the nodes in the Syntax Tree d. Construct the table for followpos() e. Build the Transition Table using followpos() and the Syntax Tree f. Draw the DFA using the Transition Table
AdrijaChoudhuri
asked
in
Theory of Computation
13 hours
ago
by
AdrijaChoudhuri
17
views
theory-of-computation
regular-expression
0
votes
0
answers
2
Gate Exam Regaular expression Theory of Computation
Answer this
Snehil01
asked
in
Theory of Computation
4 days
ago
by
Snehil01
42
views
theory-of-computation
regular-expression
regular-grammar
gatecse-2018
0
votes
1
answer
3
DFA to Regular Expression
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
May 10
by
Çșȇ ʛấẗẻ
98
views
theory-of-computation
regular-expression
0
votes
0
answers
4
Regular Expression
can you help me in question my answer is b it's correct or not, or where I'm wron Caption
Samridh28
asked
in
Theory of Computation
May 9
by
Samridh28
69
views
made-easy-booklet
theory-of-computation
regular-expression
0
votes
0
answers
5
Can someone help me for better understanding.
Tarungujral89
asked
in
Theory of Computation
May 4
by
Tarungujral89
56
views
theory-of-computation
regular-expression
number-of-dfa
1
vote
1
answer
6
Design a DFA from the given RE [ a (a* ba* ba*) * ]
manjula66
asked
in
Compiler Design
Apr 15
by
manjula66
222
views
regular-expression
finite-automata
0
votes
1
answer
7
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
117
views
finite-automata
regular-language
regular-expression
strings
8
votes
3
answers
8
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)^{*}$
admin
asked
in
Theory of Computation
Feb 15
by
admin
2.2k
views
gatecse-2023
theory-of-computation
regular-expression
1-mark
3
votes
4
answers
9
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)
admin
asked
in
Theory of Computation
Feb 15
by
admin
1.7k
views
gatecse-2023
theory-of-computation
regular-expression
1-mark
1
vote
2
answers
10
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)^*$
GO Classes
asked
in
Theory of Computation
Feb 6
by
GO Classes
568
views
memorybased-gatecse2023
goclasses
theory-of-computation
regular-expression
0
votes
0
answers
11
Regular expression
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?
mo7ammedfarooq
asked
in
Theory of Computation
Jan 16
by
mo7ammedfarooq
189
views
theory-of-computation
regular-expression
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
252
views
theory-of-computation
regular-language
regular-expression
finite-automata
0
votes
1
answer
13
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.
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
394
views
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
0
votes
1
answer
14
find all strings of lenght 4 less, for the following regular expression (a*b + b*a)
Hemant jha
asked
in
Theory of Computation
Dec 25, 2022
by
Hemant jha
199
views
theory-of-computation
regular-expression
strings
0
votes
3
answers
15
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.
moe12leb
asked
in
Theory of Computation
Nov 27, 2022
by
moe12leb
314
views
theory-of-computation
strings
regular-expression
0
votes
0
answers
16
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.
moe12leb
asked
in
Theory of Computation
Nov 27, 2022
by
moe12leb
70
views
theory-of-computation
regular-expression
strings
0
votes
1
answer
17
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.
moe12leb
asked
in
Theory of Computation
Nov 27, 2022
by
moe12leb
109
views
theory-of-computation
strings
regular-expression
0
votes
3
answers
18
#selfDoubt
what will be the DFA for RE – (a*ba)*
Dknights
asked
in
Theory of Computation
Nov 10, 2022
by
Dknights
190
views
theory-of-computation
regular-expression
0
votes
0
answers
19
#self_doubt #DFA
Regular Expression for accepting the language L = { 0^n1^m | n+m=even } I got this solution – (00)*(11)*+0(00)*1(11)* please point out how this – {(00)* (01)* (11)* } RE differs from the above one
Dknights
asked
in
Theory of Computation
Nov 9, 2022
by
Dknights
120
views
theory-of-computation
regular-expression
Page:
1
2
3
4
5
6
...
20
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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 Posts
DRDO Scientist -B
ISRO Scientist-B 2023
BARC RECRUITMENT 2023
COAP Responses | GATE CSE 2023
Interview Experience : M.Tech AI at IIT Jodhpur, Self Sponsored
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.7k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.4k)
Admissions
(665)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent questions tagged regular-expression
Recent Blog Comments
@Shubham Sharma 2 Is it possible to get a...
are MSc.(CS) students eligible?
It is said that the gate score will have 80%...
Maybe we should raise our concern in Supreme...
Mtech(RA) CSE 2023 IIT Bombay project 14. Does...