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
Peter linz exercise 2.1
[closed]
Mk Utkarsh
asked
in
Theory of Computation
Mar 4, 2018
closed
Mar 4, 2018
by
Mk Utkarsh
473
views
1
vote
1
vote
closed with the note:
..........
$\sum = \left \{ a,b \right \}$
Is it possible to create DFA for given language with less than 10 states?
L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \neq 6 \right \}$
theory-of-computation
finite-automata
Mk Utkarsh
asked
in
Theory of Computation
Mar 4, 2018
closed
Mar 4, 2018
by
Mk Utkarsh
by
Mk Utkarsh
473
views
comment
Follow
share this
share
1 comment
by
joshi_nitish
commented
Mar 4, 2018
reply
Follow
share this
no,
minimal state DFA for above language will contain 10 states only.
2
2
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Silver_Reaper
asked
in
Theory of Computation
Jan 24, 2023
387
views
An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.
Silver_Reaper
asked
in
Theory of Computation
Jan 24, 2023
by
Silver_Reaper
387
views
theory-of-computation
peter-linz
finite-automata
0
votes
0
votes
0
answers
2
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
552
views
Peter Linz Edition 4 Exercise 2.4 Question 1 (Page No. 68)
Minimize the number of states in the dfa of following figure:
Naveen Kumar 3
asked
in
Theory of Computation
Mar 30, 2019
by
Naveen Kumar 3
552
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
1
vote
1
vote
1
answer
3
Naveen Kumar 3
asked
in
Theory of Computation
Mar 22, 2019
366
views
Peter Linz Edition 4 Exercise 2.3 Question 1 (Page No. 62)
Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N= (Q_N, Σ,δ N,q0,F_N)$. Then there exists a deterministic finite accepter $M_D= (Q_D, Σ,δ_D,${$q_0$}$,F_D)$ such that $L= L (M_D)$. convert the nfa in following figure to a dfa: Can you see a simpler answer more directly?
Naveen Kumar 3
asked
in
Theory of Computation
Mar 22, 2019
by
Naveen Kumar 3
366
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
0
votes
0
votes
2
answers
4
Naveen Kumar 3
asked
in
Theory of Computation
Mar 22, 2019
548
views
Peter Linz Edition 4 Exercise 2.1 Question 25 (Page No. 49)
While the language accepted by a given dfa is unique, there are normally many dfa's that accept a language. Find a dfa with exactly six states that accepts the same language as the dfa in figure:
Naveen Kumar 3
asked
in
Theory of Computation
Mar 22, 2019
by
Naveen Kumar 3
548
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
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
