Computer Science, asked by marthamamta, 29 days ago

define finite automaton

Answers

Answered by rahul543213

Answer:

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton —also known as deterministic finite acceptor, deterministic finite-state machine, or deterministic

Explanation:

MARK BRAINLIST

Previous Question

Next Question

Similar questions

English, 14 days ago

who will answer will be marked as brainlist ...

English, 14 days ago

:) What is technology?

Environmental Sciences, 14 days ago

A cloth is covered on the thin layer to avoid any dust.

English, 29 days ago

continues in the same manner. Can this form of representation be possible always? Activity 2 Write the following sets in respective forms. Roster Form S.No. Descriptive Form Set Builder Forin The set of all natural 1 numbers less than 10 2 {x: x is a multiple of 3, xe N} 3 {2,4,6,8,10) 4 The set of all days in a week. { ... -3 -2 -1,0,1,2,3...) Tymnle...

Math, 29 days ago

simplify 42X3 y2 Z4/6xy2z3...

Physics, 8 months ago

A current of 1A flows when an electric bulb is connected to 220V mains. What would be the current when the same bulb is connected to 110V mains...

English, 8 months ago

You saw the boys running in the street (make it complex)...

Physics, 8 months ago

Who was the first CM of Meghalaya?