Computer Science, asked by musaddik1909, 7 months ago

In deterministic finite automation for each input symbol there is exactly ________ transition from each state

Answers

Answered by spandanachitti6401

0

Answer:

In a deterministic automaton, every state has exactly one transition for each possible input.

Previous Question

Next Question

Similar questions

English, 3 months ago

What was Midas’ wish? a) To become rich b) to turn anything into gold c)to turn his daughter into a golden doll d) to become powerful...

English, 3 months ago

यह चूहे है उसको इंग्लिश में क्या कहते हैं...

Science, 3 months ago

give reasons:loudspeaker should not be put in congested areas...

Hindi, 7 months ago

स हा हम घर पहच खेलने लगे |(सरल वाक्य) प्रश्न 5- रचना के अनुसार वाक्य का भेद बताइए. ( 1- वह खाना खाकर सो गया| 2- संध्या हुई और शंख बजे उठे| 3- रवि तेज दौड़ रहा है। 4- जो व्यक्ति इमानदार होता है वह संतुष्ट रह पाता है 5- आज उसे खेलते हुए चोट लग गई| 6- सत्य है परंतु छुप नहीं सकता| प्रश्न 6- शिक्षा का अधिकार' के अंतर्गत ग्रामीण...

Social Sciences, 7 months ago

what is the official name of india...

Computer Science, 11 months ago

Uses of computer in banking wikipedia...

Computer Science, 11 months ago

An article on importance of education...

English, 11 months ago

I have a head, tail, but no arms and legs. What am I? [Riddle]...