For a language that can use finite number of steps (halt on all inputs in finite number of steps) to decide the membership, we call that decidable language. Also known as recursive language.

A language is decidable if its strings are [[computable set]]. In other words, there is a [[Turing machine]] called decider which accepts strings from the language and rejects all others, never ...

Utrecht Institute of Linguistics OTS (UIL-OTS), Utrecht University, Utrecht, Netherlands Language is commonly thought of as a culturally evolved system of communication rather than a computational ...