Register

Peter linz exercise 2.1
closed

• closed by
479 views
1 votes
1 votes
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 \}$
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Silver_Reaper asked Jan 24, 2023
399 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.
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...
User Avatar
0 votes
0 votes
2 answers
4
Naveen Kumar 3 asked Mar 22, 2019
566 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:
While the language accepted by a given dfa is unique, there are normally many dfa's that accepta language. Find a dfa with exactly six states that accepts the same langua...
User Avatar
Link Copied!