Recursively defined function
recursive function is a function that calls itself during its execution. This enables the function to repeat itself several times, outputting the result and the end of each iteration. Below is an example of a recursive function.
function Count (integer N)
if (N <= 0) return “Must be a Positive Integer”;
if (N > 9) return “Counting Completed”;
else return Count (N+1);
What is relation
Whenever sets are being discussed, the relationship between the elements of the sets is the next thing that comes up. Relations may exist between objects of the same set or between objects of two or more sets
- Deterministic Finite Automaton (DFA)
- Non-deterministic Finite Automaton (NDFA / NFA)
MOORE AND MEALY MACHINE UNIT-IV
A Moore machine can be described by a 6 tuple (Q, ∑, O, δ, X, q0) where −
- Q is a finite set of states.
- ∑ is a finite set of symbols called the input alphabet.
- O is a finite set of symbols called the output alphabet.
- δ is the input transition function where δ: Q × ∑ → Q
- X is the output transition function where X: Q → O
- q0 is the initial state from where any input is processed (q0 ∈ Q)