{"id":"https://openalex.org/W1775654033","doi":"https://doi.org/10.1007/3-540-18088-5_44","title":"Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems","display_name":"Completeness results for reachability, containment, and equivalence, with respect to conflict-free vector replacement systems","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W1775654033","doi":"https://doi.org/10.1007/3-540-18088-5_44","mag":"1775654033"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-18088-5_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-18088-5_44","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/A5046658880","display_name":"R. Rodney Howell","orcid":"https://orcid.org/0000-0001-7776-9123"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rodney R. Howell","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, 78712-1188, Austin, Texas","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, 78712-1188, Austin, Texas","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109151333","display_name":"Louis E. Rosier","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Louis E. Rosier","raw_affiliation_strings":["Department of Computer Sciences, University of Texas at Austin, 78712-1188, Austin, Texas","University of Texas at Austin#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, 78712-1188, Austin, Texas","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046658880"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8681,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76392352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9945999979972839,"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.9945999979972839,"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.9901000261306763,"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/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9797999858856201,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8462548851966858},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6677458882331848},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5982236862182617},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5320984125137329},{"id":"https://openalex.org/keywords/containment","display_name":"Containment (computer programming)","score":0.5292975902557373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5116703510284424},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5035704970359802},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.4974270164966583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4342731535434723},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4048677086830139},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4045012593269348},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39571306109428406}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8462548851966858},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6677458882331848},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5982236862182617},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5320984125137329},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.5292975902557373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5116703510284424},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5035704970359802},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.4974270164966583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4342731535434723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4048677086830139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4045012593269348},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39571306109428406},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-18088-5_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-18088-5_44","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W56713903","https://openalex.org/W194455684","https://openalex.org/W266537895","https://openalex.org/W1566739370","https://openalex.org/W1966992415","https://openalex.org/W1970398023","https://openalex.org/W1970896297","https://openalex.org/W1971231744","https://openalex.org/W1973458874","https://openalex.org/W1985986492","https://openalex.org/W1998717089","https://openalex.org/W2001068306","https://openalex.org/W2008435081","https://openalex.org/W2013504313","https://openalex.org/W2017315323","https://openalex.org/W2034917600","https://openalex.org/W2054667934","https://openalex.org/W2065251436","https://openalex.org/W2071228820","https://openalex.org/W2083567135","https://openalex.org/W2087749569","https://openalex.org/W2087907688","https://openalex.org/W2089970856","https://openalex.org/W2106001218","https://openalex.org/W2162339458","https://openalex.org/W2164003033","https://openalex.org/W2913674407","https://openalex.org/W6628857929"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W4389158950","https://openalex.org/W1548979236"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}