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
#toc
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
by
Çșȇ ʛấẗẻ
65
views
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
0
votes
0
answers
2
#TOC
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
by
Çșȇ ʛấẗẻ
42
views
theory-of-computation
finite-automata
regular-expression
regular-language
0
votes
0
answers
3
Regular expression to finite automata
Çșȇ ʛấẗẻ
asked
in
Mathematical Logic
Feb 15
by
Çșȇ ʛấẗẻ
188
views
finite-automata
theory-of-computation
regular-expression
3
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 35
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$ $b b b b$ $bbaaabb$ $bbaaabbbabb$ $b b a b b b a b$
GO Classes
asked
in
Theory of Computation
Feb 5
by
GO Classes
480
views
goclasses2024-mockgate-14
theory-of-computation
regular-expression
multiple-selects
1-mark
4
votes
2
answers
5
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 62
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful transition is possible for the given symbol. Note that when encountering a $b$ in state ... $\mathrm{abbb}^+\mathrm{c}^+\mathrm{c}$ $a b^* b b(c c)^+$
GO Classes
asked
in
Theory of Computation
Jan 13
by
GO Classes
291
views
goclasses2024-mockgate-11
goclasses
theory-of-computation
finite-automata
regular-expression
2-marks
1
vote
2
answers
6
DFA to Regular Expression
Help to Convert DFA in to Regular Expression
alexmurugan
asked
in
Theory of Computation
Nov 2, 2023
by
alexmurugan
399
views
number-of-dfa
regular-expression
0
votes
2
answers
7
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Pratik.patil
asked
in
Theory of Computation
Oct 30, 2023
by
Pratik.patil
354
views
theory-of-computation
ace-test-series
regular-expression
0
votes
1
answer
8
#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?
Mrityudoot
asked
in
Theory of Computation
Oct 21, 2023
by
Mrityudoot
314
views
theory-of-computation
regular-expression
finite-automata
regular-language
0
votes
1
answer
9
Find the complement of the following expressions: (a) (a + c) (a + b’) (a’ + b + c’) (b) z + z’(v’w + xy)
dvlken
asked
in
Digital Logic
Oct 16, 2023
by
dvlken
299
views
digital-logic
regular-expression
0
votes
1
answer
10
Made easy test series
Please explain the why A and D are correct?
Rohit Chakraborty
asked
in
Theory of Computation
Oct 5, 2023
by
Rohit Chakraborty
425
views
theory-of-computation
regular-expression
number-of-dfa
made-easy-test-series
1
vote
0
answers
11
Let P,Q and R be regular expressions such that the number of strings generated by P is p, Q is q and R is r. What is the number of strings generated by the regular expression (P+R)*Q+PQ?
krati_ag19
asked
in
Theory of Computation
Sep 22, 2023
by
krati_ag19
309
views
theory-of-computation
regular-expression
0
votes
1
answer
12
Applied roots practice set3 TOC 2019
Solve this using Adrens lemma rule.
iam.sahilpatra
asked
in
Theory of Computation
Sep 16, 2023
by
iam.sahilpatra
196
views
regular-expression
0
votes
1
answer
13
made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?
kaustubh7
asked
in
Theory of Computation
Aug 24, 2023
by
kaustubh7
366
views
theory-of-computation
regular-expression
0
votes
1
answer
14
#regularexpressions #Theoryofcomputation
L = (a+b)$\small ^*$b is equivalent to ____________? A. (ab$\small^*$)$\small^+$ B. (a$\small^+$b$\small^*$)$\small^+$ C. b$\small^*$(ab$\small^*$)$\small^*$b D. None
D_i_b_y_a prakash
asked
in
Theory of Computation
Aug 14, 2023
by
D_i_b_y_a prakash
387
views
theory-of-computation
regular-expression
1
vote
1
answer
15
#Theoryofcomputation #regularexpressions
A = aa* and B = bb* ( A U B) * =? 1.{ a^nb^n | n >= 0} 2.{ a^mb^n | m, n >=0} 3.(a+b)* 4.None
D_i_b_y_a prakash
asked
in
Theory of Computation
Aug 12, 2023
by
D_i_b_y_a prakash
340
views
theory-of-computation
regular-expression
0
votes
1
answer
16
Automation exam in the Faculty of Informatics Engineering, Damascus University
What is the regular expression that accept following string aaaabbbb ؟ a) a+ b+ b) a* b* c) (a+b)* (a+b)* d) (a+b)* e) abab
Mohamad
asked
in
Theory of Computation
Aug 9, 2023
by
Mohamad
225
views
theory-of-computation
regular-expression
1
vote
2
answers
17
Self Doubt
Convert DFA to regular expression
Shaina Singh
asked
in
Theory of Computation
Jul 30, 2023
by
Shaina Singh
503
views
theory-of-computation
regular-expression
1
vote
2
answers
18
Convert given DFA to regular expression, I think it's just that 2 is dead state and thus can be eliminated.
Shaina Singh
asked
in
Theory of Computation
Jul 30, 2023
by
Shaina Singh
728
views
theory-of-computation
number-of-dfa
regular-expression
0
votes
3
answers
19
Theory of computation
Which of the following pairs of regular expression are equivalent? (a) 1(01)* and (10)*1 (b) x(xx)* and (xx)*x (c) x* and x*x (d) All of the above
gateexplore
asked
in
Theory of Computation
Jul 3, 2023
by
gateexplore
456
views
theory-of-computation
regular-expression
self-doubt
0
votes
0
answers
20
Thomson Construction
Describe Thomson Construction method for converting Regular expression into ε-NFA. Convert regular expression (a(a+b)*abb)+ab into ε-NFA.
gateexplore
asked
in
Theory of Computation
Jun 16, 2023
by
gateexplore
245
views
theory-of-computation
regular-expression
0
votes
1
answer
21
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
Rahhhhhul
asked
in
Theory of Computation
Jun 12, 2023
by
Rahhhhhul
750
views
regular-expression
regular-language
regular-grammar
theory-of-computation
Page:
1
2
3
4
5
6
...
21
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent questions tagged regular-expression
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation