[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Technical Discussion :: Finite Automata

74. what is finite automata?

Answer:

A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.



A finite automaton consists of:




  • a finite set S of N states

  • a special start state

  • a set of final (or accepting) states

  • a set of transitions T from one state to another, labeled with chars in C

Asked In :: Wipro

Post Your Answer Here:

Name *
Email
Alert me

Post Your Reply Here:

Report Error

Please Login First Click Here