递归语言
Sign in to saveAlso known as decidable
recursive subset of the set of all possible finite sequences over the alphabet of the language
In the Vinony graph
Within Vinony's link graph, 递归语言 is referenced by 104 other articles, and connects out to Kleene star, regular language and recursive set.
Vinony files it under Computability theory, Formal languages and Recursion.
Its subject is documented across 20 Wikipedia language editions.
Wikidata facts
- Subclass of
- recursively enumerable language
Show 1 more fact
- different from
- formal grammar
Sources (1)
via Wikidata · CC0
Article · 中文
在数学、逻辑和计算机科学中，递归语言或遞迴語言是也叫做可判定语言或图灵可判定语言的形式语言类型。所有递归语言的类经常被称为 。这种语言类型在乔姆斯基层级中没有定义。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
Kleene star
Entity
regular language
Entity
recursive set
Entity
decider
Entity
mathematics
Entity
logic
Entity
computer science
Entity
International Standard Book Number
Entity
algorithm
Entity
digital object identifier
Entity
mathematical logic
Entity
Turing machine
Entity
subset
Entity
recursion
Entity
formal language
Entity
homomorphism
Entity
theoretical computer science
Entity
finite-state machine
Entity
automata theory
Entity
Chomsky hierarchy
Entity