{"id":"https://openalex.org/keywords/regular-tree-languages","display_name":"regular tree languages","description":"Classes of trees recognized by finite tree automata, studied in formal language theory, logic, and computer science.","display_name_alternatives":["regular tree language","recognizable tree languages","recognizable tree language","recognisable tree languages","recognisable tree language"],"ids":{"openalex":"https://openalex.org/keywords/regular-tree-languages","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7282,"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.7282,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0991,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":360,"cited_by_count":5278,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/regular-tree-languages","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
