Reactive Synthesis Swen Jacobs, Martin Zimmermann


A note on automata

Written: 30.01.2018 17:19 Written By: Martin Zimmermann

Note that (according to our definition) deterministic automata are always complete, i.e., for every state q and every letter a there is an outgoing a-transition from q.


Please make sure that your deterministic automata are complete in the exam.

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators