Register

Peter Linz Edition 4 Exercise 3.2 Question 5 (Page No. 87)

310 views

1 Answer

0 votes
0 votes

I think in the (b) part only case is abba .   so you can simply make dfa for that.

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

Related questions

1 votes
1 votes
0 answers
1
Naveen Kumar 3 asked Apr 2, 2019
743 views
Peter Linz Edition 4 Exercise 3.2 Question 8 (Page No. 87)
Consider the following generalized transition graph. (a) Find an equivalent generalized transition graph with only two states. (b) What is the language accepted by this graph?
Consider the following generalized transition graph.(a) Find an equivalent generalized transition graph with only two states.(b) What is the language accepted by this gra...
User Avatar
1 votes
1 votes
0 answers
3
Naveen Kumar 3 asked Apr 2, 2019
226 views
Peter Linz Edition 4 Exercise 3.2 Question 6 (Page No. 87)
Find an nfa for all strings not containing the substring 101. Use this to derive a regular expression for that language.
Find an nfa for all strings not containing the substring 101. Use this to derive a regular expression for that language.
User Avatar
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Apr 2, 2019
244 views
Peter Linz Edition 4 Exercise 3.2 Question 4 (Page No. 87)
Find dfa's that accept the following languages. (a) $L (aa^* + aba^*b^*)$. (b) $L (ab (a + ab)^* (a + aa))$. (c) $L ((abab)^* + (aaa^* + b)^*)$. (d) $L (((aa^*)^* b)^*)$.
Find dfa's that accept the following languages.(a) $L (aa^* + aba^*b^*)$.(b) $L (ab (a + ab)^* (a + aa))$.(c) $L ((abab)^* + (aaa^* + b)^*)$.(d) $L (((aa^*)^* b)^*)$.
User Avatar
Link Copied!