The Gateway to Computer Science Excellence
+1 vote
24 views
Is the family of recursive languages closed under concatenation$?$
in Computer Networks by Boss (11.6k points) | 24 views

1 Answer

+1 vote

Recursive language is closed under concatenation .

 

Concatenation: If L1 and If L2 are two recursive languages, their concatenation L1.L2 will also be recursive. For Example:

    L1= {a^nb^nc^n|n>=0} 

    L2= {d^me^mf^m|m>=0}

    L3= L1.L2

    = {a^nb^nc^nd^m e^mf^m|m>=0 and n>=0}

by Boss (36.5k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,291 answers
198,212 comments
104,903 users