UNIT I TOC OVER

Given Language: {x | it is divisible by 3}
The total number of final states to be assumed in order to pass the number constituting {0, 1} is

• a) 0
  

• b) 1
  

• c) 2
  

• d) 3

what are the types of FA

• NFA

• FA & DFA

• NFA & DFA

• ALL TEH ABOVE

Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?

• a) Statement 1 is false but Statement 2 and 3 are correct
  
  

• b) Statement 1 and 2 are correct while 3 is wrong
  

• c) None of the mentioned statements are correct

• d) All of the mentioned

The minimum number of states required to recognize an octal number divisible by 3 are/is

• a) 1
  

• b) 3
  

• c) 5
  

• d) 7

Which of the following is not a part of 5-tuple finite automata?

• a) Input alphabet
  

• b) Transition function
  

• c) Initial State
  

• d) Output Alphabet

TOC full form

• THEORY OF COMPUTING

• THE OFFER OF COMPUTATION

• THEORY OF COMPUTING

• THEORY OF COMPUTATION