Recursive Language
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.
<< Previous
Word Browser
Next >>
new haven, connecticut
ontological commitment
st. elizabeths hospital
missionary
daml
haredi judaism
commercial
salt lake city, utah
dallas, texas
fort worth, texas
galveston, texas
max weismann
new orleans, louisiana
miami, florida
resource description framework
san antonio, texas
hollywood, california
benny goodman
anakin skywalker
darth vader
visual binary
spectroscopic binary
dowism
eclipsing binary
doha
jim thorpe
betelgeuse
orogeny
australian and new zealand army corps
bertoleoni
penalty area (football)
eurowordnet
corpus
death star
centre georges pompidou
noir (anime)
oberkommando der wehrmacht
academia operosorum labacensis
carniola
doric order
doric
multi sport event
night of the long knives
giant (mythology)
Copyright 2005-2009 OnPedia.com. All Rights Reserved