Scribd
Upload
4 views

UNIT6

Uploaded by

pardeshirani07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

UNIT6

Uploaded by

pardeshirani07
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

UNIT6

Decidability
Decidable language
• -A decision problem P is said to be decidable (i.e., have
an algorithm)
if the language L of all yes instances to P is decidable.
Example- (I) (Acceptance problem for DFA) Given a DFA
does it accept a given
word?
• (II) (Emptiness problem for DFA) Given a DFA does it
accept any word?
• (III) (Equivalence problem for DFA) Given two DFAs, do
they accept the
same language?
Undecidable language
• A decision problem P is said to be undecidable if the
language L of all
yes instances to P is not decidable or a language is
undecidable if it is not decidable. An undecidable
language maybe a partially decidable language or
something else but not decidable. If a language is not
even partially decidable , then there exists no Turing
machine for that language.
Partially decidable or Semi-
Decidable Language
• -– A decision problem P is said to be semi-decidable (i.e.,
have a semi-algorithm) if the language L of all yes instances
to P is RE. A language ‘L’ is partially decidable if ‘L’ is a RE
but not REC language.

Recursive language(REC) – A language ‘L’ is said to be


recursive if there exists a Turing machine which will accept
all the strings in ‘L’ and reject all the strings not in ‘L’. The
Turing machine will halt every time and give an
answer(accepted or rejected) for each and every string input.
A language ‘L’ is decidable if it is a recursive language. All
decidable languages are recursive languages and vice-versa
• Recursively enumerable language(RE) – A language
‘L’ is said to be a recursively enumerable language if
there exists a Turing machine which will accept (and
therefore halt) for all the input strings which are in ‘L’
but may or may not halt for all input strings which are
not in ‘L’. By definition , all REC languages are also RE
languages but not all RE languages are REC languages.

You might also like