Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

912 questions

1k answers


441 users

0 votes

While submitting answer to Exercise 4, Question 2 d, I tried entering 2 of the initial states(They did not have any outgoing/incoming edges) along with other actual reachable states. But it turned out to be incorrect. Then I removed them and wrote rest of states, it got accepted. 

What I had thought earlier was all initial states by default will be reachable whether or not it has incoming edges. But the answer doesn't second that thought. What's the actual answer?

Detail: For the given FSM, 

Answer I thought : (!p&q&!a&!o)|(p&q&!a&!o)|(!p&q&!a&o)|(p&q&!a&o)|(!p&q&a&!o)|(!p&q&a&o)|(p&!q&!a&o)|(p&!q&!a&!o)|(p&!q&a&!o)|(p&!q&a&o)|(p&q&a&!o)|(p&q&a&o)

Answer accepted: (!p&q&!a&!o)|(p&q&!a&!o)|(!p&q&!a&o)|(p&q&!a&o)|(p&!q&!a&o)|(p&!q&!a&!o)|(p&!q&a&!o)|(p&!q&a&o)|(p&q&a&!o)|(p&q&a&o)

in * TF "Emb. Sys. and Rob." by (230 points)

1 Answer

+1 vote
Best answer
There are multiple definitions. In this case: Reachable are those states that lie on an infinite path from an initial state. Initial states without an infinite path are not reachable according to this definition.
by (25.6k points)
selected by
Thanks for the answer. Now that makes sense.

Related questions

Imprint | Privacy Policy