Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged finiteautomata
0
votes
1
answer
self doubt on toc finit automata
What will be the number of states in minimal DFA, if every string contains aa and bb as substring ?
asked
Mar 20
in
Theory of Computation
by
Sankalp Singh 1
(
6
points)

20
views
#dfa
finiteautomata
theoryofcomputation
0
votes
0
answers
DFA/NFA MINIMUM NUMBER OF STATES
How to decide minimum when will DFA have N+2 or N+1 states? https://gateoverflow.in/39562/gate2016216 https://gateoverflow.in/8256/gate2015253 https://gateoverflow.in/118302/gate2017122 https://gateoverflow.in/118160/gate2017225 above 2 are cases for N+1 and latter are N+2
asked
Dec 6, 2019
in
Theory of Computation
by
Asim Siddiqui 4
(
8
points)

7
views
theoryofcomputation
finiteautomata
#dfa
#toc
0
votes
0
answers
Finite AutomataACE
Which of the following cannot be performed by finite automata? $(A)$ Addition of two arbitrary binary inputs $(B)$ Subtraction of two arbitrary binary inputs $(C)$ Multiplication of two arbitrary binary inputs $(D)$ None
asked
Nov 17, 2019
in
Theory of Computation
by
srestha
(
683
points)

31
views
theoryofcomputation
finiteautomata
0
votes
0
answers
ACE test Series Turing machines
asked
Nov 6, 2019
in
Theory of Computation
by
Shivateja MST
(
113
points)

23
views
finiteautomata
0
votes
0
answers
ACE Test series TOC Basic
Even though this question may look very very basic,but if any one could,please answer. Which of the following model represents a regular language? A Finite Automata B Regular expression CRegular Grammar DAll the above The answer that perfectly matches the question is B right?
asked
Nov 6, 2019
in
Theory of Computation
by
Shivateja MST
(
113
points)

36
views
finiteautomata
0
votes
0
answers
From the "Suggested Exercises" section(at the end of the book) of "Principles of Compiler Design" By Aho and Ullman.
asked
Sep 12, 2019
in
Theory of Computation
by
Sukhbir Singh
(
8
points)

17
views
automata
finiteautomata
0
votes
0
answers
number of states in the dfa? [Gate Academy TOC Topic Test Finite automata]
asked
Sep 12, 2019
in
Theory of Computation
by
Sathuri Bharath
(
74
points)

25
views
theoryofcomputation
finiteautomata
0
votes
0
answers
number of states in fa? [Gate Academy TOC Topic Test Finite automata]
asked
Sep 12, 2019
in
Theory of Computation
by
Sathuri Bharath
(
74
points)

14
views
theoryofcomputation
finiteautomata
0
votes
1
answer
what is the regular expression for the language? [Gate Academy TOC Topic Test Finite automata]
asked
Sep 12, 2019
in
Theory of Computation
by
Sathuri Bharath
(
74
points)

26
views
#regularlanguage
finiteautomata
theoryofcomputation
0
votes
1
answer
Deterministic FA
What are the number of final states in minimal DFA, where Σ= {a, b}, if every string starts with “aa” and length of string is not congruent to 0 (mod 4). A. 7 B. 6 C. 3 D. 5
asked
Aug 12, 2019
in
Theory of Computation
by
Sambhrant Maurya
(
401
points)

25
views
theoryofcomputation
finiteautomata
0
votes
0
answers
ACE Workbook  Finite automata and Regular Language
asked
Aug 11, 2019
in
Theory of Computation
by
user2525
(
1.6k
points)

13
views
theoryofcomputation
#regularlanguage
finiteautomata
0
votes
1
answer
Epsilon NFA doubt
Please show the approach. I am not fully aware of how delta star works. Does it mean applying epsilon *, a, epsilon * on qo state? Kindly explain. Thank you.
asked
Aug 11, 2019
in
Theory of Computation
by
DukeThunders
(
415
points)

10
views
theoryofcomputation
finiteautomata
0
votes
0
answers
Made Easy workbook  Finite Automata
While doing reversal of a Finite automata, we change the arrows and interchange the final and initial states. But if there are more than one final state in F.A. are we supposed to merge the final states into one final state and then do the reversal of the finite automata. Is it the correct procedure for reversal of finite automata wth multiple final states ?
asked
Aug 11, 2019
in
Theory of Computation
by
user2525
(
1.6k
points)

11
views
#regularlanguage
theoryofcomputation
finiteautomata
0
votes
1
answer
NFA with epsilon moves  Automata theory ( Testbook Test Series )
asked
Aug 11, 2019
in
Theory of Computation
by
user2525
(
1.6k
points)

15
views
theoryofcomputation
finiteautomata
#regularlanguage
+1
vote
1
answer
Regular Language  Theory of Computation
Which of the following are regular languages ? $wxw^R ( w ∈ (a,b)^* , x ∈ (a,b)^* )$ $wxw^R ( w ∈ (a,b)^* , x ∈ (a,b)^+ )$ $wxw^R ( w ∈ (a,b)^+ , x ∈ (a,b)^* )$ $wxw^R ( w ∈ (a,b)^+ , x ∈ (a,b)^+ )$ $wxw ( w ∈ (a,b)^* , x ∈ (a,b)^* )$ ... $wxw ( w ∈ (a,b)^+ , x ∈ (a,b)^* )$ $wxw ( w ∈ (a,b)^+ , x ∈ (a,b)^+ )$ Here $w^R$ is reversal of string $w$.
asked
Aug 9, 2019
in
Theory of Computation
by
user2525
(
1.6k
points)

19
views
theoryofcomputation
finiteautomata
#regularlanguage
0
votes
1
answer
Stanford Lagunita
Which of the following grammars produce regular languages? A → (A)/ε A → (A(/ε A → (B)/(BB) B → (CC)/(CCC) C → (DDD) D → () A→ aA/b A→ Aa/b A→ aaAb/ε A→ AAaab/ε A→ AAaab/aab
asked
Aug 9, 2019
in
Theory of Computation
by
Sambhrant Maurya
(
401
points)

20
views
theoryofcomputation
regularlanguages
regulargrammar
finiteautomata
0
votes
0
answers
ACE Test Series  Finite automata and regular language
asked
Aug 8, 2019
in
Theory of Computation
by
user2525
(
1.6k
points)

44
views
theoryofcomputation
finiteautomata
#regularlanguage
0
votes
1
answer
Self Doubt: Theory of Computation
What is the difference between intersection and cross product of DFAs? Are they both same?
asked
Jul 20, 2019
in
Theory of Computation
by
commenter commenter
(
31
points)

23
views
theoryofcomputation
dfas
finiteautomata
0
votes
1
answer
Finiteautomata
asked
Jul 19, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

14
views
theoryofcomputation
madeeasyworkbook
finiteautomata
#regularexpression
0
votes
1
answer
Finite automata to Regular Expression
The language recognized by the given finite automata is A. (aa + ∊) (b + ba) (bab)* B. (aab + ba) (bab)* C. (aab) (bab)* + (bab)* D. (aab) (∈ + (bab)*)*
asked
Jul 17, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

15
views
#regularexpression
#regularlanguage
theoryofcomputation
finiteautomata
madeeasyworkbook
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Apr 2020
Kushagra गुप्ता
36 Points
!KARAN
36 Points
Ram Swaroop
36 Points
sushmitagoswami
6 Points
iot_ts
6 Points
ConnieSincla
5 Points
MelinaCundif
5 Points
Lolita04I641
5 Points
JackiBandy49
5 Points
skbansal97
5 Points
3,525
questions
1,658
answers
10,465
comments
90,046
users