26-Recursive and Recursively Enumerable Languages-04-04-2023
26-Recursive and Recursively Enumerable Languages-04-04-2023
26-Recursive and Recursively Enumerable Languages-04-04-2023
is ( V + T )*.
In type 0 there must be at least one variable on the Left side of production.
For example:
Sab --> ba
A --> S
Here, Variables are S, A, and Terminals a, b.
|\alpha |<=|\beta |
is no restriction on
|\alpha | = 1.
For example:
S --> AB
A --> a
B --> b
Undecidable Problems
The problems for which we can’t construct an algorithm that can answer the
problem correctly in the infinite time are termed as Undecidable Problems in
the theory of computation (TOC).
A problem is undecidable if there is no Turing machine that will always halt an
infinite amount of time to answer as ‘yes’ or ‘no’.
Examples
The examples of undecidable problems are explained below. Here, CFG refers
to Context Free Grammar.
Whether two CFG L and M equal − Since, we cannot determine all
the strings of any CFG, we can predict that two CFG are equal or
not.
Given a context-free language, there is no Turing machine (TM)
that will always halt an infinite amount of time and give an answer
to whether language is ambiguous or not.
Given two context-free languages, there is no Turing machine that
will always halt an infinite amount of time and give an answer
whether two context-free languages are equal or not.
Whether CFG will generate all possible strings of the input
alphabet (∑*) is undecidable.
M Abb aa aaa
N Bba aaa aa
Here,
x2x1x3 = ‘aaabbaaa’
and y2y1y3 = ‘aaabbaaa’
We can see that
x2x1x3 = y2y1y3
Hence, the solution is i = 2, j = 1, and k = 3.
Example 2
Find whether the lists M = (ab, bab, bbaaa) and N = (a, ba, bab) have a Post
Correspondence Solution?
Solution
x1 x2 x3
M ab bab bbaaa
N a ba bab