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

870 questions

988 answers


439 users

0 votes
An automata is deterministic if it is designed as per below conditions :

1. Only 1 initial state in entire automata.

2. From one state on a unique input should make a transition to another state.

3. Should have transition from all combination of inputs (set of inputs)

Could you please confirm if above description is correct regarding the deterministic automata ?

If there is something else I am missing could you please let me know ?
in * TF "Emb. Sys. and Rob." by (2.9k points)

1 Answer

+1 vote
Best answer
An automaton is deterministic iff it has only one initial state and the transition relation is a total function from inputs and states to states. Hence, every word has a unique run. That is all that you need.
by (139k points)
selected by
Thank you for this explanation.
Imprint | Privacy Policy