Register

Book: Peter Linz, Introduction to Formal Languages and automata, 6th edition, 2017. Chapter2.1 Exercise 17

• retagged by
221 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
3
Silver_Reaper asked Jan 24, 2023
408 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
1 votes
1 votes
2 answers
4
ANJALI SAWARKAR asked Jul 27, 2017
1,047 views
an introduction to formal languages (peter linz) chapter2..excercise ..7th (d)
L= {w: na(w) mod 3 >nb(w)mod 3}. how we will make dfa of this?
L= {w: na(w) mod 3 >nb(w)mod 3}. how we will make dfa of this?
User Avatar
Link Copied!