Recursive language: Difference between revisions

Revision as of 12:10, 2 November 2016

Revision as of 16:34, 21 April 2017

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]] φ