{"id":"https://openalex.org/keywords/pushdown-automata","display_name":"pushdown automata","description":"Pushdown automata are computational models with finite control and a stack, used to recognize context-free languages in formal language theory.","display_name_alternatives":["pushdown automaton","push-down automata","push-down automaton","PDA","PDAs"],"ids":{"openalex":"https://openalex.org/keywords/pushdown-automata","wikidata":"https://www.wikidata.org/wiki/Q751443"},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.7171,"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.7171,"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":1910,"cited_by_count":36319,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/pushdown-automata","updated_date":"2026-10-17T04:06:27","created_date":"2026-09-30T00:00:00"}