in Theory of Computation
42 views
0 votes
0 votes

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma$ ?

  1. It could be undecidable
  2. It is Turing-machine recognizable
  3. It is a context sensitive language.
  4. It is a regular language.
  5. None of the above,
in Theory of Computation
by
589 points
42 views

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.