Take FREE!! Online Cocubes Mock Test to Crack various Companies Written Exams.
Get Off-Campus Placement Jobs Info !!!
Take 30+ FREE!! Online Arithmetic Aptitude Mock test to crack any Exams.
Technical Discussion :: Finite Automata

1 / 6

what is finite automata?


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:

Rate This: +3 -0      +

Post Your Reply Here:

Alert me

Report Error

Please Login First Click Here

Most Popular Qs.