{"id":"https://openalex.org/keywords/non-regular-languages","display_name":"non-regular languages","description":"Formal languages that cannot be recognized by any finite automaton, studied in automata theory and the theory of computation.","display_name_alternatives":["nonregular languages","non-regular language","nonregular language"],"ids":{"openalex":"https://openalex.org/keywords/non-regular-languages","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7672,"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.7672,"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":164,"cited_by_count":2003,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/non-regular-languages","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
