{"id":"https://openalex.org/W4322775206","doi":"https://doi.org/10.46298/lmcs-19(1:15)2023","title":"Pushdown Automata and Context-Free Grammars in Bisimulation Semantics","display_name":"Pushdown Automata and Context-Free Grammars in Bisimulation Semantics","publication_year":2023,"publication_date":"2023-03-02","ids":{"openalex":"https://openalex.org/W4322775206","doi":"https://doi.org/10.46298/lmcs-19(1:15)2023"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(1:15)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:15)2023","pdf_url":"https://lmcs.episciences.org/11014/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/11014/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110382800","display_name":"J. C. M. Baeten","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jos C. M. Baeten","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands","University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046207861","display_name":"Cesare Carissimo","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Cesare Carissimo","raw_affiliation_strings":["University of Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067908378","display_name":"Bas Luttik","orcid":"https://orcid.org/0000-0001-6710-8436"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bas Luttik","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110382800"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":0.626,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69273739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 19, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.994700014591217,"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.9051610231399536},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7396924495697021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7079600691795349},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.6520856618881226},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.6289962530136108},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6225220561027527},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6055090427398682},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.5404710173606873},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5335462689399719},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5298547148704529},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5139076709747314},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4636247158050537},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4320725202560425},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.42320355772972107},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.41182658076286316},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3458777666091919},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2808426320552826},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2498534917831421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23113897442817688},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1466963291168213}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.9051610231399536},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7396924495697021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7079600691795349},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.6520856618881226},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.6289962530136108},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6225220561027527},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6055090427398682},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.5404710173606873},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5335462689399719},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5298547148704529},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5139076709747314},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4636247158050537},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4320725202560425},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.42320355772972107},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.41182658076286316},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3458777666091919},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2808426320552826},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2498534917831421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23113897442817688},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1466963291168213}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/lmcs-19(1:15)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:15)2023","pdf_url":"https://lmcs.episciences.org/11014/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:cwi:oai:cwi.nl:32931","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/32931","pdf_url":"https://ir.cwi.nl/pub/32931/32931.pdf","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 19(1), 15:1 - 15:32","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/9a365432-b09a-4199-863c-5f2d5aeee767","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9a365432-b09a-4199-863c-5f2d5aeee767","pdf_url":"https://pure.tue.nl/ws/files/317339647/2203.01713.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baeten, J C M, Carissimo, C & Luttik, B 2023, 'Pushdown Automata and Context-Free Grammars in Bisimulation Semantics', Logical Methods in Computer Science, vol. 19, no. 1, pp. 15:1-15:32. https://doi.org/10.46298/LMCS-19(1:15)2023","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:5867e0feb44f4bfeb70c2b2b57957434","is_oa":true,"landing_page_url":"https://doaj.org/article/5867e0feb44f4bfeb70c2b2b57957434","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(1:15)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:15)2023","pdf_url":"https://lmcs.episciences.org/11014/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4322775206.pdf"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W110490872","https://openalex.org/W623593394","https://openalex.org/W1584306444","https://openalex.org/W1969947545","https://openalex.org/W1972478730","https://openalex.org/W1985161650","https://openalex.org/W2109146692","https://openalex.org/W2117297757","https://openalex.org/W2121397369","https://openalex.org/W2125382028","https://openalex.org/W2133442509","https://openalex.org/W2141955344","https://openalex.org/W2167018151","https://openalex.org/W2497620028","https://openalex.org/W2678861921","https://openalex.org/W2753785322","https://openalex.org/W2922322777","https://openalex.org/W2964221281","https://openalex.org/W2972270955","https://openalex.org/W3105358497","https://openalex.org/W3105803818","https://openalex.org/W3112938681","https://openalex.org/W3127093985","https://openalex.org/W3140281301","https://openalex.org/W4233538608","https://openalex.org/W4244174860","https://openalex.org/W4288400169"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W127918926","https://openalex.org/W4206600150","https://openalex.org/W214992615","https://openalex.org/W2089141720","https://openalex.org/W2068249429","https://openalex.org/W4322775206","https://openalex.org/W4226300816"],"abstract_inverted_index":{"The":[0],"Turing":[1,30,41],"machine":[2],"models":[3],"an":[4],"old-fashioned":[5],"computer,":[6],"that":[7,32,121],"does":[8,20,33],"not":[9,34],"interact":[10],"with":[11,15,27,108],"the":[12,39,53,84,88,98,122,127,131],"user":[13],"or":[14],"other":[16,67],"computers,":[17],"and":[18,70,75,93],"only":[19],"batch":[21],"processing.":[22],"Therefore,":[23],"we":[24,57,65,82,111],"came":[25],"up":[26],"a":[28,48,105,113,134],"Reactive":[29,40],"Machine":[31],"have":[35,44],"these":[36],"shortcomings.":[37],"In":[38,52,79],"Machine,":[42],"transitions":[43],"labels":[45],"to":[46,104,125],"give":[47],"notion":[49,135],"of":[50,61,87,101,133,136],"interactivity.":[51],"resulting":[54],"process":[55,99],"graph,":[56],"use":[58],"bisimilarity":[59],"instead":[60],"language":[62],"equivalence.":[63],"Subsequently,":[64],"considered":[66],"classical":[68,85],"theorems":[69],"notions":[71],"from":[72],"automata":[73,92],"theory":[74],"formal":[76],"languages":[77],"theory.":[78],"this":[80],"paper,":[81],"consider":[83],"theorem":[86],"correspondence":[89,115,129],"between":[90],"pushdown":[91],"context-free":[94],"grammars.":[95],"By":[96],"changing":[97],"operator":[100,107],"sequential":[102],"composition":[103],"sequencing":[106],"intermediate":[109],"acceptance,":[110],"get":[112],"better":[114],"in":[116],"our":[117],"setting.":[118],"We":[119],"find":[120],"missing":[123],"ingredient":[124],"recover":[126],"full":[128],"is":[130],"addition":[132],"state":[137],"awareness.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}