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

928 questions

1k answers

1.4k comments

441 users

+1 vote

I have the following conditions. I = q and R = !(a&q&next(q)|(next(p)->(p->o))).

Upon generating the CDNF i have the following minterms:

p&!q&!a&!o&next(p)&next(q)

p&!q&a&!o&next(p)&next(q)

p&!q&!a&!o&next(p)&!next(q)

p&q&a&!o&next(p)&!next(q)

p&q&!a&!o&next(p)&!next(q|

p&q&!a&!o&next(p)&next(q)

p&!q&a&!o&next(p)&!next(q)
Following these I generated this FSM.
 

I am trying to submit the following solution:
init 1,3;
transitions (2,{a},{},2); (2,{},{},2); (2,{a},{},3); (2,{},{},3); (3,{a},{},2); (3,{},{},2); (3,{},{},3);
Which for some reason is not being accepted. I have tried with and without state 1 as initial state. 
Please Help. 
Thankyou.
in * TF "Emb. Sys. and Rob." by (400 points)

1 Answer

+1 vote
Try this consider state 'p' as 1 and state 'q' as 2

And to the transition accordingly
by (360 points)
I cannot believe I am that dumb. Thankyou so much. This helped.
No problem. By the way I've one doubt, how do you find reachable state? My option is wrong.
Start with the initial states, add successors over and over until no more new states are added. Here, you will probably have to remove states that only have finite paths.

Related questions

0 votes
1 answer
asked May 21, 2020 in * TF "Emb. Sys. and Rob." by RS (770 points)
0 votes
2 answers
asked May 22, 2020 in * TF "Emb. Sys. and Rob." by nikita (300 points)
0 votes
1 answer
0 votes
3 answers
asked May 22, 2020 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
Imprint | Privacy Policy
...