Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 60

• recategorized by
3,791 views

2 Answers

1 votes
1 votes
FA requires no stack , If stack is added it will be PDA and if 2 stacks are added it is similar to Turing Machine.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
4 answers
1
admin asked Mar 31, 2020
1,694 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 3
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
User Avatar
2 votes
2 votes
3 answers
2
admin asked Mar 31, 2020
1,629 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
User Avatar
1 votes
1 votes
4 answers
3
admin asked Mar 31, 2020
3,745 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : Union Dot Kleene None of the options
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
User Avatar
1 votes
1 votes
2 answers
4
admin asked Mar 31, 2020
3,482 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 31
A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$
A finite automaton accepts which type of language : Type $0$Type $1$Type $2$Type $3$
User Avatar
Link Copied!