{"id":"https://openalex.org/keywords/state-complexity","display_name":"state complexity","description":"State complexity is an automata-theoretic measure of the minimum number of states required to recognize a formal language or the result of an operation on languages.","display_name_alternatives":["automaton state complexity","automata state complexity"],"ids":{"openalex":"https://openalex.org/keywords/state-complexity","wikidata":"https://www.wikidata.org/wiki/Q30595656"},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7508,"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.7508,"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":1175,"cited_by_count":13760,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/state-complexity","updated_date":"2026-11-18T04:07:20","created_date":"2022-04-12T19:38:12"}
