Revision as of 16:34, 21 April 2017 edit 2405:205:830e:40ed:f95a:d449:21e9:3336 (talk) →Closure properties ← Previous edit		Revision as of 16:34, 21 April 2017 edit undo 2405:205:830e:40ed:f95a:d449:21e9:3336 (talk) →Closure properties Next edit →
Line 29: == Closure properties == Recursive languages are ~~not closed~~[[closure (mathematics)\|closed]] under the following operations. That is, if ''L'' and ''P'' are two recursive languages, then the following languages are recursive as well: * The [[Kleene star]] <math>L^</math> The image φ(L) under an [[Homomorphism#Homomorphisms and e-free homomorphisms in formal language theory\|e-free homomorphism]] φ

Recursive language: Difference between revisions