Define following through descriptive definition i. Define the language of double factorial for strings defined over ∑={ a,b} as { a n! b n! : n=1,2,3,4,.... ii. The language L of strings that start with ba and end with ab, defined over Σ={a,b,c},
Define following through descriptive definition
i. Define the language of double factorial for strings defined over ∑={ a,b} as { a n! b
n! :
n=1,2,3,4,....
ii. The language L of strings that start with ba and end with ab, defined over Σ={a,b,c},
Languages can be represented with distinct techsniques. For example:
by utilizing the Descriptive definition, by utilizing the Recursive definition, by utilizing the Regular Expressions, by utilizing the Finite Automaton(FA), etc.
Descriptive Definition of language
A language can be defined and we can generate the strings but only the string of the given language.
The language is defined, representing the conditions imposed on its words. s
Example:
Descriptive definition of the language for strings of even length, defined over Σ={b}
It can be defined
L={bb, bbbb, bbbbbb, bbbbbbbb…..}
with b to be 2,4,6,8.....
1.
For the language of double factorial for strings defined over ∑={ a,b} as { an! bn! : n=1,2,3,4,.... }
Factorial of any number n is n x (n-1) x (n-2) x .... x1
Example: 5! = 5*4*3*2*1 = 120
for n=1 , an! bn! = a1! b1! = ab
for n=2, a2! b2! = a2 b2 = aabb
for n=3, a3! b3! = a6 b6 = aaaaaabbbbbb
The descriptive definition therefore will be
{ab, aabb, aaaaaabbbbbb, ...........}
2.
Step by step
Solved in 3 steps
