{"id":"https://openalex.org/W1502255017","doi":"https://doi.org/10.1007/978-3-662-43951-7_20","title":"Bisimulation Equivalence of First-Order Grammars","display_name":"Bisimulation Equivalence of First-Order Grammars","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1502255017","doi":"https://doi.org/10.1007/978-3-662-43951-7_20","mag":"1502255017"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43951-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_20","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/A5083815456","display_name":"Petr Jan\u010dar","orcid":"https://orcid.org/0000-0002-8738-9850"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Jan\u010dar","raw_affiliation_strings":["Dept Comp. Sci., FEI, Techn. Univ. of Ostrava (V\u0160B-TUO), Ostrava, Czech Rep","FEI, Techn. Univ. of Ostrava (V\u0160B-TUO)"],"affiliations":[{"raw_affiliation_string":"Dept Comp. Sci., FEI, Techn. Univ. of Ostrava (V\u0160B-TUO), Ostrava, Czech Rep","institution_ids":["https://openalex.org/I142208455"]},{"raw_affiliation_string":"FEI, Techn. Univ. of Ostrava (V\u0160B-TUO)","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083815456"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8008,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72395101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8333700299263},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8160192966461182},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7941813468933105},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.7758926153182983},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7087045907974243},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6972172260284424},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6648733615875244},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5579137206077576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523788332939148},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5108048915863037},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4947149455547333},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4234873652458191},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.35137519240379333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3512774109840393},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.30269718170166016},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.2862754464149475},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25831377506256104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23418524861335754},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1966741383075714},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18887749314308167},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.11765947937965393},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09214210510253906}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8333700299263},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8160192966461182},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7941813468933105},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7758926153182983},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7087045907974243},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6972172260284424},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6648733615875244},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5579137206077576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523788332939148},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5108048915863037},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4947149455547333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4234873652458191},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.35137519240379333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3512774109840393},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.30269718170166016},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.2862754464149475},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25831377506256104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23418524861335754},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1966741383075714},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18887749314308167},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.11765947937965393},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09214210510253906}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-43951-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43951-7_20","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W18618678","https://openalex.org/W136524193","https://openalex.org/W173099331","https://openalex.org/W1503973138","https://openalex.org/W1508399233","https://openalex.org/W1539922307","https://openalex.org/W1555553717","https://openalex.org/W1594502574","https://openalex.org/W1607820520","https://openalex.org/W1751071023","https://openalex.org/W1993997214","https://openalex.org/W1998608869","https://openalex.org/W2002981190","https://openalex.org/W2014771515","https://openalex.org/W2018817970","https://openalex.org/W2020570874","https://openalex.org/W2022264236","https://openalex.org/W2024130312","https://openalex.org/W2037747061","https://openalex.org/W2045344413","https://openalex.org/W2051521505","https://openalex.org/W2064514470","https://openalex.org/W2096329705","https://openalex.org/W2098401737","https://openalex.org/W2109548990","https://openalex.org/W2111753126","https://openalex.org/W2129121801","https://openalex.org/W2138316064","https://openalex.org/W2142944765","https://openalex.org/W2951623158","https://openalex.org/W2953367752","https://openalex.org/W2963956714","https://openalex.org/W3099251988","https://openalex.org/W3125224867"],"related_works":["https://openalex.org/W1991406344","https://openalex.org/W2012479020","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W2074593591","https://openalex.org/W2177744885","https://openalex.org/W392685101","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W4241567000"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}