{"id":"https://openalex.org/keywords/emptiness-checking","display_name":"emptiness checking","description":"A formal verification procedure that determines whether a computational model or language accepts any states, behaviors, or words.","display_name_alternatives":["emptiness check","emptiness testing","language emptiness checking","checking emptiness"],"ids":{"openalex":"https://openalex.org/keywords/emptiness-checking","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6795,"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/T10142","display_name":"Formal Methods in Verification","score":0.6795,"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/T11567","display_name":"semigroups and automata theory","score":0.1578,"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":144,"cited_by_count":11952,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/emptiness-checking","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
