Recursive_language Recursive_language

Recursive language - Definition

In computer science a formal language is called recursive or decidable if there exists an algorithm to decide for any given string w over the alphabet of the language, if w belongs to the language or not.

More formally, a formal language is called recursive if and only if it is a recursive subset in the set of all possible words over the alphabet of the language.

All regular, context-free and context-sensitive languages are recursive.

Recursive - Example Usage
adron: Had a lot of data conversations in the last 48 hours. A LOT of conversations. Which makes for a lot of data. Self recursive data. Yup.
bazscott: “@imnk: Recursive animation blocks ftw” absolutely, and check out that line wrapping :)
imnk: Recursive animation blocks ftw
rickasaurus: @AboutDev Haskell is so fast because they made the runtime. In F# you can optimize it away by making recursive functions.
kixxauth: Ending the recursive culture of blame (via Etsy engineering) http://t.co/FWoJEtwH
Copyright 2010 WordIQ.com - Privacy Policy  :: Terms of Use  :: Contact Us  :: About Us
This article is licensed under the GNU Free Documentation License. It uses material from the this Wikipedia article.