Given the transition relation $\delta \subseteq S \times \Sigma \times \Gamma \times S$, where the $S$'s are the source and target states respectively, while the $\Sigma$ is the set of input alphabet, and $\Gamma$ is the set of output alphabet. The definition that I want to write about state determinism which basically says that the state $q$ is considered to be deterministic if and only if for every input symbol there is only one output generated and one target state. I am writing down my definition, so please if it is wrong correct me.
$\forall a \in \Sigma,\forall c'\in \Gamma, \forall d'\in \Gamma, \forall r \in S, \forall r' \in S$ $if (q,a,c',r)\in \delta $ then $(q,a,d',r')\not \in \delta$. My concerns can we put it more simple as there are many "forall" . Another question are the cases of $r=r'$ or $c'=d'$ are covered in the "then" part or not as those cases are not deterministic.
Also to make sure that I got the correct output I will write down cases where I won't them to be excluded.
let assume we have (q,a,b',r) as a valid transition. Are the following transitions are not accepted in the modified definition.? Because the target of my definition is to say all these cases are not valid.
1.(q,a,b'',r).
2.(q,a,b'',r').
3.(q,a,b',r').
Many thanks
– user440526 May 31 '13 at 21:17