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
Some useful problems
Recent questions tagged finite-automata
0
votes
2
answers
1
Regular expression
is a(ba)*=(ab)*a?
nbhatt
asked
in
Theory of Computation
6 days
ago
by
nbhatt
71
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
answers
2
Regular expression
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
nbhatt
asked
in
Theory of Computation
Sep 21
by
nbhatt
55
views
theory-of-computation
finite-automata
regular-expression
0
votes
1
answer
3
Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
dutta18
asked
in
Theory of Computation
Sep 21
by
dutta18
51
views
theory-of-computation
finite-automata
number-of-dfa
0
votes
1
answer
4
Regular expression
What will be the regular expression for following fa using recurrence relation method.
nbhatt
asked
in
Theory of Computation
Sep 21
by
nbhatt
55
views
theory-of-computation
regular-expression
finite-automata
1
vote
3
answers
5
Regular expression
Is (a+ab*b)* and (ab*)* same or not?
nbhatt
asked
in
Theory of Computation
Sep 15
by
nbhatt
197
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
answers
6
#Toc #regularexpression
How to convert (a+b)* into a minimal Dfa
Srken
asked
in
Theory of Computation
Sep 4
by
Srken
70
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
answers
7
Self Doubt.
what is the difference between, r* and r^(*) can anyone please elaborate !
akash_chauhan
asked
in
Theory of Computation
Jul 20
by
akash_chauhan
130
views
theory-of-computation
regular-expression
finite-automata
1
vote
2
answers
8
Draw a DFA (Deterministic Finite Automation) in which first two bits are the same as the last two bits
rohankrishan
asked
in
Theory of Computation
Jul 1
by
rohankrishan
204
views
finite-automata
theory-of-computation
0
votes
1
answer
9
Draw a DFA (Deterministic Finite Automation) that has a its thrid to last digit as a 1
Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states
rohankrishan
asked
in
Theory of Computation
Jun 30
by
rohankrishan
88
views
theory-of-computation
finite-automata
0
votes
2
answers
10
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
rohankrishan
asked
in
Theory of Computation
Jun 30
by
rohankrishan
94
views
theory-of-computation
finite-automata
Page:
1
2
3
4
5
6
...
32
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged finite-automata
Recent Blog Comments
previous years than GATE 2010 paper
Which link are you referring to?
@Arjun I am not able to see GATE 2010...
Should be working now
@Arjun Sir but it is not working. i dont know...