{"id":"https://openalex.org/W1584306444","doi":"https://doi.org/10.1007/978-3-540-85361-9_11","title":"A Context-Free Process as a Pushdown Automaton","display_name":"A Context-Free Process as a Pushdown Automaton","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1584306444","doi":"https://doi.org/10.1007/978-3-540-85361-9_11","mag":"1584306444"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-85361-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85361-9_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5110382800","display_name":"J. C. M. Baeten","orcid":null},"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":true,"raw_author_name":"J. C. M. Baeten","raw_affiliation_strings":["Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033505407","display_name":"Pjl Pieter Cuijpers","orcid":"https://orcid.org/0000-0002-5487-4972"},"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":"P. J. L. Cuijpers","raw_affiliation_strings":["Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032690747","display_name":"P. J. A. van Tilburg","orcid":null},"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":"P. J. A. van Tilburg","raw_affiliation_strings":["Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Division of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#","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/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9174,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83838599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"98","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9995999932289124,"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.9555107355117798},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.9247466325759888},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.816205620765686},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7984392046928406},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.6973823308944702},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6824765801429749},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.6429762840270996},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5376175045967102},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.5109633207321167},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5033044219017029},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4984316825866699},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.46882009506225586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4623734951019287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46211865544319153},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4401164948940277},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.3818838894367218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3447865843772888},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3423902988433838},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.29130858182907104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2647058963775635},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.13911399245262146},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.13520964980125427},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.12913495302200317},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10926726460456848},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.06441614031791687}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.9555107355117798},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.9247466325759888},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.816205620765686},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7984392046928406},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.6973823308944702},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6824765801429749},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.6429762840270996},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5376175045967102},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.5109633207321167},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5033044219017029},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4984316825866699},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.46882009506225586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4623734951019287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46211865544319153},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4401164948940277},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3818838894367218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3447865843772888},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3423902988433838},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.29130858182907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2647058963775635},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.13911399245262146},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.13520964980125427},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.12913495302200317},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10926726460456848},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.06441614031791687},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-540-85361-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-85361-9_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:publications/f5f76e90-a5e1-4324-aa3f-ec17f096c6ad","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f5f76e90-a5e1-4324-aa3f-ec17f096c6ad","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Baeten, J C M, Cuijpers, P J L & Tilburg, van, P J A 2008, A context-free process as a pushdown automaton. in F Breugel, van & M Chechik (eds), CONCUR 2008 - Concurrency Theory (19th International Conference, Toronto, Canada, August 19-22, 2008, Proceedings). Lecture Notes in Computer Science, vol. 5201, Springer, Berlin, pp. 98-113. https://doi.org/10.1007/978-3-540-85361-9_11","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:664410","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=664410","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:664410","is_oa":false,"landing_page_url":"http://repository.tue.nl/664410","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/f5f76e90-a5e1-4324-aa3f-ec17f096c6ad","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/f5f76e90-a5e1-4324-aa3f-ec17f096c6ad","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CONCUR 2008 - Concurrency Theory (19th International Conference, Toronto, Canada, August 19-22, 2008, Proceedings), 98 - 113","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W173674133","https://openalex.org/W623593394","https://openalex.org/W1492408604","https://openalex.org/W1495688666","https://openalex.org/W1496259920","https://openalex.org/W1582292473","https://openalex.org/W1589421353","https://openalex.org/W1598641851","https://openalex.org/W1883453769","https://openalex.org/W1972478730","https://openalex.org/W1985161650","https://openalex.org/W2095975761","https://openalex.org/W2098981343","https://openalex.org/W2106934908","https://openalex.org/W2109220893","https://openalex.org/W2142944765","https://openalex.org/W2148973802","https://openalex.org/W2151272968","https://openalex.org/W2170151971","https://openalex.org/W2340102009","https://openalex.org/W2616044496","https://openalex.org/W2912614885","https://openalex.org/W3000511677","https://openalex.org/W4211195649","https://openalex.org/W4244719572","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2089141720","https://openalex.org/W127918926","https://openalex.org/W2400175085","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1987397434","https://openalex.org/W2047588061","https://openalex.org/W2023439061","https://openalex.org/W4379744627"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}