Team A
there are _______ tuples in a finite state machine
5
states, input symbols, initial state, accepting state and transition function.
Number of states require to accept strings that end with 10.
3
minimal string q0,1-->q1,0-->q2
3 sates:q0,q1,q2
According to Chomsky classification, the language of finite automata is ______type.
type 3
Finite automata requires minimum _______ number of stacks
1
0
2
none
0
Finite automata doesn’t require any stack operation
The basic limitation of finite automata is that:
a. It can’t remember arbitrary large amount of information.
b. It sometimes fails to recognize regular grammar
c. It sometimes recognize grammar that are not regular
d. all of the above
a.
Because there is no memory associated with automata.
Kleenes' closure contains:
a. empty string
b. null string
c. both a and b
d. none
a.
Given Σ, then the Kleene Star Closure of the alphabet Σ, denoted by Σ*, is the collection of all strings defined over Σ, including epsilon (empty string).
Transition function maps to _________
Q * Σ ->Q
what is the number of final states required to accept Φ in minimal finite automata?
None.
No final state is required at all as it is a null string in nature.
How many languages are over the alphabet R?
uncountable infinite
A language over an alphabet R is a set of strings over A which is uncountable and infinite