{"id":"https://openalex.org/keywords/descriptional-complexity","display_name":"descriptional complexity","description":"Descriptional complexity is the study of the size and expressive efficiency of formal descriptions, such as automata, grammars, and language representations.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/descriptional-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.8288,"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.8288,"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.0802,"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":588,"cited_by_count":5152,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/descriptional-complexity","updated_date":"2026-11-19T04:05:57","created_date":"2026-09-30T00:00:00"}
