[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 Interview Questions and Answers :: Finite Automata

    1 / 6

    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

    Please Login First :

    2 / 6

    What are the types of finite automata?
    Answer:

    No Discussion on this question yet!

    Please Login First :

    3 / 6

    What is the difference between the strings and the words of a language?
    Answer:

    No Discussion on this question yet!

    Please Login First :

    4 / 6

    What is the difference between an Alphabet and an element of a set. Whether Alphabet is an element of a set or it is a set itself?
    Answer:

    Please Login First :

    5 / 6

    What is the difference between FA , TG , GTG. ?
    Answer:

    This is not perfect answer


    Please Login First :

    6 / 6

    Make a FA which will accept only 3 strings 110.
    Answer:

    No Discussion on this question yet!

    Please Login First :