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

1.1k questions

1.2k answers

1.6k comments

529 users

0 votes



can [a SU b] be expressed as an automaton in this way?

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

1 Answer

0 votes

The drawing of the automaton makes sense to me, but the transition relation is not correct. You just have the following three transitions:

!q & !next(q) & !b & a  |
!q &  next(q) &  b |
 q &  next(q) 
So, the above should be your transition relation, the rest is fine!
by (166k points)

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...