{"id":"https://openalex.org/W2049167443","doi":"https://doi.org/10.1007/s10849-011-9134-0","title":"The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars","display_name":"The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars","publication_year":2011,"publication_date":"2011-06-20","ids":{"openalex":"https://openalex.org/W2049167443","doi":"https://doi.org/10.1007/s10849-011-9134-0","mag":"2049167443"},"language":"en","primary_location":{"id":"doi:10.1007/s10849-011-9134-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10849-011-9134-0","pdf_url":null,"source":{"id":"https://openalex.org/S197419112","display_name":"Journal of Logic Language and Information","issn_l":"0925-8531","issn":["0925-8531","1572-9583"],"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":"Journal of Logic, Language and Information","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/A5040246991","display_name":"Stephan Kepser","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133934","display_name":"Bernstein Center for Computational Neuroscience T\u00fcbingen","ror":"https://ror.org/03kfnwp54","country_code":"DE","type":"government","lineage":["https://openalex.org/I4210092532","https://openalex.org/I4210133934"]},{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stephan Kepser","raw_affiliation_strings":["Collaborative Research Center 441, University of T\u00fcbingen, T\u00fcbingen, Germany"],"affiliations":[{"raw_affiliation_string":"Collaborative Research Center 441, University of T\u00fcbingen, T\u00fcbingen, Germany","institution_ids":["https://openalex.org/I4210133934","https://openalex.org/I8087733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003459898","display_name":"J. H. Rogers","orcid":null},"institutions":[{"id":"https://openalex.org/I130712669","display_name":"Earlham College","ror":"https://ror.org/0566sj483","country_code":"US","type":"education","lineage":["https://openalex.org/I130712669"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jim Rogers","raw_affiliation_strings":["Computer Science Department, Earlham College, Richmond, IN, USA","Computer Science Department, Earlham College Richmond, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Earlham College, Richmond, IN, USA","institution_ids":["https://openalex.org/I130712669"]},{"raw_affiliation_string":"Computer Science Department, Earlham College Richmond, USA","institution_ids":["https://openalex.org/I130712669"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040246991"],"corresponding_institution_ids":["https://openalex.org/I4210133934","https://openalex.org/I8087733"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.2769,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.87732753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"361","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9979000091552734,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"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.9273282885551453},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.8493213653564453},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.7454843521118164},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.7160086035728455},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.6517415642738342},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.590833842754364},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.5624065399169922},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5260802507400513},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5166847705841064},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4859703779220581},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.47595950961112976},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4658077359199524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43856024742126465},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3820651173591614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31822752952575684},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23745453357696533},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.19359126687049866}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.9273282885551453},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.8493213653564453},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.7454843521118164},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.7160086035728455},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.6517415642738342},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.590833842754364},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.5624065399169922},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5260802507400513},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5166847705841064},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4859703779220581},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.47595950961112976},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4658077359199524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43856024742126465},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3820651173591614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31822752952575684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23745453357696533},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.19359126687049866}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10849-011-9134-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10849-011-9134-0","pdf_url":null,"source":{"id":"https://openalex.org/S197419112","display_name":"Journal of Logic Language and Information","issn_l":"0925-8531","issn":["0925-8531","1572-9583"],"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":"Journal of Logic, Language and Information","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1479758177","https://openalex.org/W1533614358","https://openalex.org/W1560202022","https://openalex.org/W1971051128","https://openalex.org/W2027650493","https://openalex.org/W2036540855","https://openalex.org/W2068249429","https://openalex.org/W2071328460","https://openalex.org/W2078866770","https://openalex.org/W2105233779","https://openalex.org/W2130630493","https://openalex.org/W2911295106","https://openalex.org/W4211152277","https://openalex.org/W4212777788"],"related_works":["https://openalex.org/W1992439855","https://openalex.org/W24640121","https://openalex.org/W2403874525","https://openalex.org/W1609763579","https://openalex.org/W2002749975","https://openalex.org/W2067980891","https://openalex.org/W1524907688","https://openalex.org/W2041988689","https://openalex.org/W2130892661","https://openalex.org/W1558243495"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}