L is a language over {x,y,z} where x's are never preceded by y's and never followed by z's
Asked
Active
Viewed 91 times
-2
Aastha Dahal
- 329
- 2
- 11
-
http://meta.softwareengineering.stackexchange.com/questions/6166/open-letter-to-students-with-homework-problems – EJoshuaS - Stand with Ukraine Oct 30 '16 at 21:09
-
I post this question because I have have a answer for my own, but I just want to know how other community members solves it. – Aastha Dahal Oct 30 '16 at 21:14
-
What's your answer? – EJoshuaS - Stand with Ukraine Oct 31 '16 at 01:13
1 Answers
-1
This DFA can also be drawn using AND for two part,i.e first part is x's are never preceded by y's
second part is x's are never followed by z's
Sulav Timsina
- 703
- 7
- 20
-
This answer should label all non-A states as accepting, and it has an extraneous state that has no transitions into it. – Welbog Nov 09 '16 at 22:08