{"id":"https://openalex.org/W2088602194","doi":"https://doi.org/10.1007/bf00289017","title":"The complexity of graph languages generated by hyperedge replacement","display_name":"The complexity of graph languages generated by hyperedge replacement","publication_year":1990,"publication_date":"1990-04-01","ids":{"openalex":"https://openalex.org/W2088602194","doi":"https://doi.org/10.1007/bf00289017","mag":"2088602194"},"language":"en","primary_location":{"id":"doi:10.1007/bf00289017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289017","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5041314551","display_name":"Clemens Lautemann","orcid":null},"institutions":[{"id":"https://openalex.org/I197323543","display_name":"Johannes Gutenberg University Mainz","ror":"https://ror.org/023b0x485","country_code":"DE","type":"education","lineage":["https://openalex.org/I197323543"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Clemens Lautemann","raw_affiliation_strings":["Fachbereich Mathematik, Johannes Gutenberg-Universit\u00e4t, Saarstrasse 21, D-6500, Mainz, Federal Republic of Germany","Johannes Gutenberg University , Mainz, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, Johannes Gutenberg-Universit\u00e4t, Saarstrasse 21, D-6500, Mainz, Federal Republic of Germany","institution_ids":["https://openalex.org/I197323543"]},{"raw_affiliation_string":"Johannes Gutenberg University , Mainz, Germany","institution_ids":["https://openalex.org/I197323543"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041314551"],"corresponding_institution_ids":["https://openalex.org/I197323543"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.9777,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.86893594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"5","first_page":"399","last_page":"421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9929999709129333,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6651368141174316},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6626710891723633},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5217179656028748},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5037960410118103},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.4992964267730713},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.46309852600097656},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.45145851373672485},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43551862239837646},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.42690783739089966},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42232733964920044},{"id":"https://openalex.org/keywords/parser-combinator","display_name":"Parser combinator","score":0.417820006608963},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.41776710748672485},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.4112907350063324},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4103078842163086},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3940611481666565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36783337593078613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32512450218200684},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.32097840309143066},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.3058311343193054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1838245689868927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6651368141174316},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6626710891723633},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5217179656028748},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5037960410118103},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.4992964267730713},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.46309852600097656},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.45145851373672485},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43551862239837646},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.42690783739089966},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42232733964920044},{"id":"https://openalex.org/C118364021","wikidata":"https://www.wikidata.org/wiki/Q7139956","display_name":"Parser combinator","level":3,"score":0.417820006608963},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41776710748672485},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.4112907350063324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4103078842163086},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3940611481666565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36783337593078613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32512450218200684},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.32097840309143066},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.3058311343193054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1838245689868927},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00289017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289017","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W22407023","https://openalex.org/W152064238","https://openalex.org/W421997344","https://openalex.org/W654355797","https://openalex.org/W1510854324","https://openalex.org/W1524358346","https://openalex.org/W1576087595","https://openalex.org/W1580074612","https://openalex.org/W1588996601","https://openalex.org/W1598694679","https://openalex.org/W1965022641","https://openalex.org/W1979328074","https://openalex.org/W1991146349","https://openalex.org/W1992040352","https://openalex.org/W2002089154","https://openalex.org/W2011884447","https://openalex.org/W2016113382","https://openalex.org/W2029448190","https://openalex.org/W2030734020","https://openalex.org/W2037692988","https://openalex.org/W2041034381","https://openalex.org/W2041437718","https://openalex.org/W2043360684","https://openalex.org/W2061817376","https://openalex.org/W2068755149","https://openalex.org/W2083312088","https://openalex.org/W2085550081","https://openalex.org/W2092518753","https://openalex.org/W2096529162","https://openalex.org/W2488234670","https://openalex.org/W2913924563","https://openalex.org/W4241108585","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W3143982968","https://openalex.org/W4320024782","https://openalex.org/W2090257971","https://openalex.org/W1560736395","https://openalex.org/W2108246103","https://openalex.org/W2077094028","https://openalex.org/W2175212756","https://openalex.org/W2943197582","https://openalex.org/W2624167784","https://openalex.org/W108108158"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}