{"id":"https://openalex.org/W2067542357","doi":"https://doi.org/10.1016/0304-3975(83)90138-x","title":"Constructing a realtime deterministic pushdown automaton from a grammar","display_name":"Constructing a realtime deterministic pushdown automaton from a grammar","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2067542357","doi":"https://doi.org/10.1016/0304-3975(83)90138-x","mag":"2067542357"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(83)90138-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90138-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028742425","display_name":"Jan Pittl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107376","display_name":"Institute of Mathematical Machines","ror":"https://ror.org/01x675h84","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210107376"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jan Pittl","raw_affiliation_strings":["Research Institute for Mathematical Machines, 11855 Praha 1, Czechoslovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Mathematical Machines, 11855 Praha 1, Czechoslovakia","institution_ids":["https://openalex.org/I4210107376"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109051398","display_name":"Amiram Yehudai","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amiram Yehudai","raw_affiliation_strings":["Computer Science Department, Tel-Aviv University, Tel-Aviv, Israel","Comput. Sci. Dept., Tel Aviv Univ., Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Comput. Sci. Dept., Tel Aviv Univ., Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.23152709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"22","issue":"1-2","first_page":"57","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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.9965000152587891,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.992900013923645,"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.989300012588501,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8541272878646851},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8534697890281677},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7542555332183838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6278500556945801},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.6136583089828491},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5439029932022095},{"id":"https://openalex.org/keywords/regular-grammar","display_name":"Regular grammar","score":0.5060178637504578},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.5030757784843445},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.41994157433509827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4189562201499939},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.38008302450180054},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.29655876755714417},{"id":"https://openalex.org/keywords/emergent-grammar","display_name":"Emergent grammar","score":0.2400602102279663},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.22260886430740356},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22233504056930542},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.17918255925178528},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.17034482955932617},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.1589517891407013},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.15240955352783203},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.10671505331993103},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.09050443768501282}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8541272878646851},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8534697890281677},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7542555332183838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6278500556945801},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.6136583089828491},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5439029932022095},{"id":"https://openalex.org/C80191660","wikidata":"https://www.wikidata.org/wiki/Q645527","display_name":"Regular grammar","level":4,"score":0.5060178637504578},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.5030757784843445},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.41994157433509827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4189562201499939},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.38008302450180054},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.29655876755714417},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.2400602102279663},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.22260886430740356},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22233504056930542},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.17918255925178528},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.17034482955932617},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.1589517891407013},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.15240955352783203},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.10671505331993103},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.09050443768501282},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(83)90138-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90138-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W956032893","https://openalex.org/W1535681052","https://openalex.org/W1557692985","https://openalex.org/W1963502093","https://openalex.org/W1968127341","https://openalex.org/W1986683780","https://openalex.org/W2010117085","https://openalex.org/W2041168146","https://openalex.org/W2070015363","https://openalex.org/W2078050093","https://openalex.org/W2281456769","https://openalex.org/W2785940568","https://openalex.org/W4206644645","https://openalex.org/W6633404604","https://openalex.org/W6639274868","https://openalex.org/W6695255758","https://openalex.org/W6748492325"],"related_works":["https://openalex.org/W1991406344","https://openalex.org/W2012479020","https://openalex.org/W392685101","https://openalex.org/W2177744885","https://openalex.org/W2906736223","https://openalex.org/W2811163417","https://openalex.org/W2067895928","https://openalex.org/W214992615","https://openalex.org/W1972232894","https://openalex.org/W4231088732"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}