Register
Dark Mode

NIELIT 2017 DEC Scientific Assistant A - Section B: 60

in Theory of Computation recategorized by
3,668 views
2 votes
2 votes

Finite automata requires minimum ____________ number of stacks.

  1. $1$
  2. $0$
  3. $2$
  4. None of the options
in Theory of Computation recategorized by
by
3.7k views

2 Answers

1 vote
1 vote
finite automata requires no stack. hence the option B is correct.
by
1 vote
1 vote
FA requires no stack , If stack is added it will be PDA and if 2 stacks are added it is similar to Turing Machine.
by
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!