{"id":"https://openalex.org/W2091862052","doi":"https://doi.org/10.1016/0020-0190(94)00170-4","title":"Completeness results concerning systolic tree automata and E0L languages","display_name":"Completeness results concerning systolic tree automata and E0L languages","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2091862052","doi":"https://doi.org/10.1016/0020-0190(94)00170-4","mag":"2091862052"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00170-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00170-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5027315672","display_name":"Angelo Monti","orcid":"https://orcid.org/0000-0002-3309-8249"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Angelo Monti","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, I-56125 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084949095","display_name":"Alessandro Roncato","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Roncato","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, I-56125 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e1 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Corso Italia 40, I-56125 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084949095"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5368,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.67996506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"1","first_page":"11","last_page":"16"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9988999962806702,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/pspace","display_name":"PSPACE","score":0.6553726196289062},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6259596347808838},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5752338767051697},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5507565140724182},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5433109998703003},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5368896126747131},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.5345427393913269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.526075541973114},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.48649948835372925},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4801692068576813},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.47416797280311584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44046950340270996},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.43364769220352173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3841377794742584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36023253202438354},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.30656132102012634},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27798837423324585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26254135370254517},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.2617923617362976},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14272242784500122}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6553726196289062},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6259596347808838},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5752338767051697},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5507565140724182},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5433109998703003},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5368896126747131},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.5345427393913269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.526075541973114},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.48649948835372925},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4801692068576813},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.47416797280311584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44046950340270996},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.43364769220352173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3841377794742584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36023253202438354},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30656132102012634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27798837423324585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26254135370254517},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2617923617362976},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14272242784500122},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)00170-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00170-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/47720","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/47720","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.75,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W97765767","https://openalex.org/W170046506","https://openalex.org/W176614514","https://openalex.org/W1522715372","https://openalex.org/W1525397299","https://openalex.org/W1859552527","https://openalex.org/W1968427680","https://openalex.org/W1978521889","https://openalex.org/W1983934395","https://openalex.org/W1985499786","https://openalex.org/W2002089154","https://openalex.org/W2030683793","https://openalex.org/W2040241433","https://openalex.org/W2060170289","https://openalex.org/W2067102568","https://openalex.org/W2081564114","https://openalex.org/W3161358707","https://openalex.org/W4302339081","https://openalex.org/W6603990309","https://openalex.org/W6607288174","https://openalex.org/W6631343329","https://openalex.org/W6795908573"],"related_works":["https://openalex.org/W2036269369","https://openalex.org/W2148265818","https://openalex.org/W2963086563","https://openalex.org/W2585424667","https://openalex.org/W4210247746","https://openalex.org/W1572551939","https://openalex.org/W3116703249","https://openalex.org/W2970654527","https://openalex.org/W3037493117","https://openalex.org/W2091862052"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}