{"id":"https://openalex.org/W1999471820","doi":"https://doi.org/10.2178/jsl/1268917499","title":"Some natural decision problems in automatic graphs","display_name":"Some natural decision problems in automatic graphs","publication_year":2010,"publication_date":"2010-03-18","ids":{"openalex":"https://openalex.org/W1999471820","doi":"https://doi.org/10.2178/jsl/1268917499","mag":"1999471820"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1268917499","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1268917499","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic Logic","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/A5077823013","display_name":"Dietrich Kuske","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dietrich Kuske","raw_affiliation_strings":["Labri, CNRS, Universit\u00e9 Bordeaux I, 351, Cours de la Lib\u00e9ration F-33405 Talence, France. E-mail:","Labri, CNRS, Universit\u00e9 Bordeaux I, 351, Cours de la Lib\u00e9ration F-33405 Talence, France. E-mail: kuske@labri.fr"],"affiliations":[{"raw_affiliation_string":"Labri, CNRS, Universit\u00e9 Bordeaux I, 351, Cours de la Lib\u00e9ration F-33405 Talence, France. E-mail:","institution_ids":["https://openalex.org/I4210166017","https://openalex.org/I15057530","https://openalex.org/I1294671590","https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Labri, CNRS, Universit\u00e9 Bordeaux I, 351, Cours de la Lib\u00e9ration F-33405 Talence, France. E-mail: kuske@labri.fr","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I1294671590","https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["Universit\u00e4t Leipzig, Institut f\u00fcr Informatik Postfach 100920, D-04009 Leipzig, Germany. E-mail:","Universit\u00e4t Leipzig, Institut f\u00fcr Informatik Postfach 100920, D-04009 Leipzig, Germany. E-mail: lohrey@informatik.uni-Leipzig.de"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Leipzig, Institut f\u00fcr Informatik Postfach 100920, D-04009 Leipzig, Germany. E-mail:","institution_ids":["https://openalex.org/I926574661"]},{"raw_affiliation_string":"Universit\u00e4t Leipzig, Institut f\u00fcr Informatik Postfach 100920, D-04009 Leipzig, Germany. E-mail: lohrey@informatik.uni-Leipzig.de","institution_ids":["https://openalex.org/I926574661"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077823013"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210166017"],"apc_list":null,"apc_paid":null,"fwci":3.12365791,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90752546,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"75","issue":"2","first_page":"678","last_page":"710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/longest-path-problem","display_name":"Longest path problem","score":0.6328352093696594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5894613265991211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5740939974784851},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5619708299636841},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5543820858001709},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5476237535476685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5267652273178101},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.509748637676239},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4333666265010834},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42738786339759827},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3224276304244995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.296555757522583},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19498184323310852}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6328352093696594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5894613265991211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5740939974784851},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5619708299636841},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5543820858001709},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5476237535476685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5267652273178101},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.509748637676239},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4333666265010834},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42738786339759827},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3224276304244995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.296555757522583},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19498184323310852},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2178/jsl/1268917499","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1268917499","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1268917499","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1268917499","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W191309568","https://openalex.org/W564848705","https://openalex.org/W1501571921","https://openalex.org/W1517606395","https://openalex.org/W1523399120","https://openalex.org/W1536001468","https://openalex.org/W1547822735","https://openalex.org/W1564588006","https://openalex.org/W1594645185","https://openalex.org/W1966217515","https://openalex.org/W1982939827","https://openalex.org/W1984103222","https://openalex.org/W2008686032","https://openalex.org/W2017025480","https://openalex.org/W2024551482","https://openalex.org/W2033186040","https://openalex.org/W2057670391","https://openalex.org/W2085533703","https://openalex.org/W2087443598","https://openalex.org/W2087818742","https://openalex.org/W2089351755","https://openalex.org/W2090451983","https://openalex.org/W2098604425","https://openalex.org/W2102168847","https://openalex.org/W2105259569","https://openalex.org/W2109496763","https://openalex.org/W2117832390","https://openalex.org/W2296095876","https://openalex.org/W2334491427","https://openalex.org/W2401195125","https://openalex.org/W2530006810","https://openalex.org/W2798588639","https://openalex.org/W2951439955","https://openalex.org/W3099901893","https://openalex.org/W3213583783","https://openalex.org/W6629810137","https://openalex.org/W6654663888"],"related_works":["https://openalex.org/W603403972","https://openalex.org/W4287117052","https://openalex.org/W4385588236","https://openalex.org/W3176308333","https://openalex.org/W31595256","https://openalex.org/W4288422263","https://openalex.org/W2028363955","https://openalex.org/W2016277208","https://openalex.org/W4289672287","https://openalex.org/W1964113132"],"abstract_inverted_index":{"Abstract":[0],"For":[1],"automatic":[2,68,90,103,121],"and":[3,17,37,53,91,127],"recursive":[4,77,93,106,124],"graphs,":[5],"we":[6],"investigate":[7],"the":[8,33,39,74,113],"following":[9],"problems:":[10],"(A)":[11,85],"existence":[12,18,27,48],"of":[13,19,28,35,41,49,57,62,112],"a":[14,24,45],"Hamiltonian":[15],"path":[16,22],"an":[20,29,50,54],"infinite":[21,42,51,55],"in":[23,44],"tree":[25,46],"(B)":[26,97],"Euler":[30],"path,":[31],"bounding":[32,38],"number":[34,40],"ends,":[36],"branches":[43],"(C)":[47,116],"clique":[52],"version":[56],"set":[58],"cover":[59],"The":[60],"complexity":[61],"these":[63,83],"problems":[64,84],"is":[65],"determined":[66],"for":[67,76,89,92,102,105,109,120,123],"graphs":[69,94,107,125],"and.":[70],"supplementing":[71],"results":[72,80],"from":[73],"literature,":[75],"graphs.":[78],"Our":[79],"show":[81],"that":[82],"are":[86,98,117],"equally":[87],"complex":[88,101],"(":[95],"-complete).":[96],"moderately":[99],"less":[100],"than":[104,122],"(complete":[108],"different":[110],"levels":[111],"arithmetic":[114],"hierarchy),":[115],"much":[118],"simpler":[119],"(decidable":[126],"-complete,":[128],"resp.).":[129]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-02-13T15:27:49.765798","created_date":"2025-10-10T00:00:00"}