RIFT VALLEY UNIVERSTY BISHOFTU CAMPUS

DEPARTMENT OF COMPUTER SCIENCE

GROUP ASSIMENT ON AUTOMATA AND COMPLEXITY THEORY

ASSIMENT I
SUBMITED BY: - ID.NO
•ZERFE TEDECHA…………….0129/12
•DESU MOSISA……………….0103/12
•ADANECH YEFRU…………..0082/12
•ABEBECH FIKADU………….0081/12
SUBMITED TO: - SOLOMON .S
BISHOFTU ETHIOPIA 2022
 What is Recursive function
 A recursive function is a function that calls itself during its
execution. The process may repeat several times, outputting the
result and the end of each iteration.
 Recursive function(programming), a function which references
itself
General Recursive function computable partial function from
natural numbers to natural numbers.
 Primitive Recursive function, a function which can be computed
with loops of bounded length. Another name for computable
function
 What is Recursive function
A recursive function is a function in code that refers to itself
for execution. Recursive functions can be simple or elaborate.
They allow for more efficient code writing, for instance, in the
listing or compiling of sets of numbers, strings or other
variables through a single reiterated process.
In programming terms, a recursive function can be defined
as a routine that calls itself directly or indirectly. Using the
recursive algorithm, certain problems can be solved quite
easily
 What is recursion and give example?
Recursion means "defining a problem in terms
of itself". This can be a very powerful tool in
writing algorithms. Recursion comes directly
from Mathematics, where there are many
examples of expressions written in terms of
themselves. For example, the Fibonacci
sequence is defined as: F(i) = F(i-1) + F(i-2)
 example of recursion function
For example, Count(1) would return
2,3,4,5,6,7,8,9,10. Count(7) would return
8,9,10. The result could be used as a
roundabout way to subtract the number
from 10. Recursive functions allow
programmers to write efficient programs
using a minimal amount of code.
 recursive language and recursive enumerable
language
A recursively enumerable language is a
recursively enumerable subset in the set of all
possible words over the alphabet of the
language. A recursively enumerable language is
a formal language for which there exists a Turing
machine (or other computable function) which
will enumerate all valid strings of the language.
 recursive language and recursive enumerable
language
In mathematics logic and computer science, a formal
language is called recursively
enumerable (also recognizable, partially decidable, semi
decidable, Turing-acceptable or Turing-recognizable) if it
is a recursively enumerable subset in the set of all
possible words over the alphabet of the language, i.e., if
there exists a Turing machine which will enumerate all
valid strings of the language.
 What is the difference between recursive
and recursive enumerable language?
The main difference is that in recursively
enumerable language the machine halts for input
strings which are in language L. but for input strings
which are not in L, it may halt or may not halt. When
we come to recursive language it always halt
whether it is accepted by the machine or not.
 Recursive Language
 A language L is recursive (decidable) if L is the set of
strings accepted by some Turing Machine (TM) that
halts on every input.
Example
 When a Turing machine reaches a final state, it halts.
We can also say that a Turing machine M halts when M
reaches a state q and a current symbol ‘a’ to be scanned
so that δ(q, a) is undefined.
 Recursive Enumerable Language
A language L is recursively enumerable if L is the set of strings
accepted by some TM.
If L is a recursive enumerable language then −
If w ∈ L then a TM halts in a final state,
If w ∉ L then a TM halts in a non-final state or loops forever.
If L is a recursive language then −
If w ∈ L then a TM halts in a final state,
If w ∉ L then TM halts in a non-final state.
Thankyou