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
B) Construct DFA for the following regular expressions and assure the minimum number of states in the constructed DFA. (i) ab*a*(a/b) (ii) 1(1+0)* + 10(0 + 1) *
ankitak70853211234
asked
in
Compiler Design
Jul 2, 2022
478
views
0
votes
0
votes
number-of-dfa
compiler-design
ankitak70853211234
asked
in
Compiler Design
Jul 2, 2022
by
ankitak70853211234
478
views
answer
comment
Follow
share this
share
2 Comments
by
AngshukN
commented
Jul 2, 2022
reply
Follow
share this
If i am understanding correctly (a/b) means (a + b)? .. then i) has 6 states including a null state and ii) has 4 states including a null state ?
0
0
by
aamod
commented
Jul 22, 2022
reply
Follow
share this
If am getting for 1) 5 states including dead state having 3 final state. 2) Getting 4 states including dead state having 2 final state.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Hritik1204
asked
in
Theory of Computation
Jan 5
269
views
Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______
Hritik1204
asked
in
Theory of Computation
Jan 5
by
Hritik1204
269
views
theory-of-computation
finite-automata
number-of-dfa
minimal-state-automata
0
votes
0
votes
0
answers
2
Talha Riaz
asked
in
Theory of Computation
Mar 23
26
views
THEORY OF AUTOMATA ASSIGNMENT # 1 1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}: a. All strings that do not end with aa. b. All strings that contain an even number of b’s c. All strings that contain atleast two a’s or exactly two b’s d. All strings that ends with double letters (aa or bb) e. All strings that does not ends with double letter.(can end with ab or ba)
Talha Riaz
asked
in
Theory of Computation
Mar 23
by
Talha Riaz
26
views
0
votes
0
votes
0
answers
3
rania
asked
in
Theory of Computation
Feb 14
109
views
Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given. In all parts, Σ = {a, b}.{w| w does not contain the substring ab} {w| w does not contain the substring baba} {w| w contains neither the substrings ab nor ba} {w| w is any string not in a∗ ∪ b∗ } ( ∪ is the union )
rania
asked
in
Theory of Computation
Feb 14
by
rania
109
views
0
votes
0
votes
0
answers
4
Shongkor
asked
in
Compiler Design
Nov 4, 2022
541
views
Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. Arithmetic expressions in postfix notation. Left-associative lists of identifiers separated by commas. Right-associative lists of identifiers separated by commas. Arithmetic expressions of integers and identifiers with the four binary operators +, -, *, /
Shongkor
asked
in
Compiler Design
Nov 4, 2022
by
Shongkor
541
views
compiler-design
context-free-grammar
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
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy