A Kleene characterization of computability (Q845916): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Abstract grammars based on transductions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3859267 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on morphic characterization of languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On characterizations of recursively enumerable languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iteration of rational transductions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterated a-NGSM maps and Γ systems / rank | |||
Normal rank |
Latest revision as of 10:58, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Kleene characterization of computability |
scientific article |
Statements
A Kleene characterization of computability (English)
0 references
29 January 2010
0 references
formal languages
0 references
Kleene
0 references
recursive enumerable
0 references
binary relation
0 references