0
$\begingroup$

Given a language L, I've shown that L is not regular. Can I conclude that it is not decidable or are there non-regular languages that are decidable?

$\endgroup$
4
$\begingroup$

Context-free languages are not regular but decidable; on the other hand recursively enumerable languages are not regular and only semi-decidable. So sadly only knowing about the non-regularity of a language does not help with determining its decidability.

$\endgroup$

Your Answer

By clicking "Post Your Answer", you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.