{"id":"https://openalex.org/keywords/recursive-languages","display_name":"recursive languages","description":"Formal languages for which an algorithm can decide, in finite time, whether any given string belongs to the language.","display_name_alternatives":["decidable languages","recursive language","decidable language"],"ids":{"openalex":"https://openalex.org/keywords/recursive-languages","wikidata":"https://www.wikidata.org/wiki/Q1455907"},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.4158,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.4158,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.2358,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":157,"cited_by_count":3209,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/recursive-languages","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
