In finite automata, Q stands for?
Finite set of input symbolsB.
Finite set of statesD.
One Start state
Final state is represented by?
_________ of FA are represented by circles
How many arrow does intermediate states have?
In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?
Can be true or falseD.
Can not say
There are ________ tuples in finite state machine
Number of states require to accept string ends with 10.
Languages of a automata is
If it haltsB.
If it is accepted by automataC.
If automata touch final state in its life timeD.
All language are language of automata
Language of finite automata is
The basic limitation of finite automata is that
it can’t remember arbitrary large amount of informationB.
it sometimes recognize grammar that are not regularC.
it sometimes fails to recognize regular grammarD.
None of the above