Homework Help Question & Answers

If L is recursive, is it necessarily true that L^+ is also recursive? Peter Lin: Formal...

If L is recursive, is it necessarily true that L^+ is also recursive?

Peter Lin: Formal Language and Automata

0 0
Add a comment
Answer #1

Recursive languages are closed under the following operations. That is, if L and P are two recursive languages, then the following languages are recursive as well :

The concatenation L\circ P
The union L\cup P
The intersection L\cap P
The complement of L
The Kleene closure or Kleene star L*
The Kleene Plus L+ (Which You were asking)
The set difference L-P
The last property follows from the fact that the set difference can be expressed in terms of intersection and complement.

"Every Language type which is closed under Kleene star, is also closed under Kleene Plus.

Every Language type which is NOT closed under Kleene star, is also NOT closed under Kleene Plus. "

Add a comment
Know the answer?
Add Answer to:
If L is recursive, is it necessarily true that L^+ is also recursive? Peter Lin: Formal...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coin

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.