{"id":"https://openalex.org/W1994753582","doi":"https://doi.org/10.1007/bf00289591","title":"A characterization of context-free string languages by directed node-label controlled graph grammars","display_name":"A characterization of context-free string languages by directed node-label controlled graph grammars","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W1994753582","doi":"https://doi.org/10.1007/bf00289591","mag":"1994753582"},"language":"en","primary_location":{"id":"doi:10.1007/bf00289591","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289591","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/A5033890197","display_name":"Dirk Janssens","orcid":"https://orcid.org/0000-0001-9981-1900"},"institutions":[{"id":"https://openalex.org/I149213910","display_name":"University of Antwerp","ror":"https://ror.org/008x57b05","country_code":"BE","type":"education","lineage":["https://openalex.org/I149213910"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"D. Janssens","raw_affiliation_strings":["Department of Mathematics, University of Antwerp, U.I.A., B-2610, Wilrijk, Belgium","Department of Mathematics, University of Antwerp, U.I.A., Belgium B-2610#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Antwerp, U.I.A., B-2610, Wilrijk, Belgium","institution_ids":["https://openalex.org/I149213910"]},{"raw_affiliation_string":"Department of Mathematics, University of Antwerp, U.I.A., Belgium B-2610#TAB#","institution_ids":["https://openalex.org/I149213910"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110486000","display_name":"Grzegorz Rozenberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Rozenberg","raw_affiliation_strings":["Institute of Applied Mathematics and Computer Science, University of Leiden, 2300, RA Leiden, The Netherlands","Institute of Applied Mathematics and Computer Science, University of Leiden, RA Leiden, The Netherlands 2300#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics and Computer Science, University of Leiden, 2300, RA Leiden, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Institute of Applied Mathematics and Computer Science, University of Leiden, RA Leiden, The Netherlands 2300#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033890197"],"corresponding_institution_ids":["https://openalex.org/I149213910"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.7353,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88793103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"1","first_page":"63","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9822999835014343,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9657999873161316,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.7701472043991089},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.6786723136901855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6313741207122803},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.5496724843978882},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5211958289146423},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.47599780559539795},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.46998870372772217},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4322003126144409},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.43169111013412476},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4091232717037201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3990180492401123},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.394369512796402},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.38092470169067383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3775003254413605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34768593311309814},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3408064842224121},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.1867310106754303}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.7701472043991089},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.6786723136901855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6313741207122803},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5496724843978882},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5211958289146423},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.47599780559539795},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.46998870372772217},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4322003126144409},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.43169111013412476},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4091232717037201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3990180492401123},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.394369512796402},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.38092470169067383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3775003254413605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34768593311309814},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3408064842224121},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.1867310106754303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00289591","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00289591","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":[{"id":"https://metadata.un.org/sdg/4","score":0.6399999856948853,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1574796876","https://openalex.org/W2002048494","https://openalex.org/W2084036153","https://openalex.org/W2249439629","https://openalex.org/W2488234670","https://openalex.org/W2914032487","https://openalex.org/W4232876216"],"related_works":["https://openalex.org/W24640121","https://openalex.org/W2041988689","https://openalex.org/W2403874525","https://openalex.org/W1609763579","https://openalex.org/W2067980891","https://openalex.org/W2098975473","https://openalex.org/W37677999","https://openalex.org/W2345119559","https://openalex.org/W2124761490","https://openalex.org/W1608157979"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}