{"id":"https://openalex.org/W2465207406","doi":"https://doi.org/10.1142/s0129054105003248","title":"DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS","display_name":"DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS","publication_year":2005,"publication_date":"2005-07-05","ids":{"openalex":"https://openalex.org/W2465207406","doi":"https://doi.org/10.1142/s0129054105003248","mag":"2465207406"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003248","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003248","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MARKUS LOHREY","raw_affiliation_strings":["FMI, University of Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"FMI, University of Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005500210"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33900846,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"04","first_page":"707","last_page":"722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.4699999988079071,"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.4699999988079071,"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.4092999994754791,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11703","display_name":"Rings, Modules, and Algebras","score":0.021800000220537186,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.9366942644119263},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8861926794052124},{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.8469553589820862},{"id":"https://openalex.org/keywords/free-monoid","display_name":"Free monoid","score":0.7981060743331909},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.7476481199264526},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.5699281692504883},{"id":"https://openalex.org/keywords/syntactic-monoid","display_name":"Syntactic monoid","score":0.5697759389877319},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5164730548858643},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5159576535224915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4973306953907013},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43712836503982544},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42572182416915894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42553436756134033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3631948232650757},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13387447595596313}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9366942644119263},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8861926794052124},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.8469553589820862},{"id":"https://openalex.org/C149685015","wikidata":"https://www.wikidata.org/wiki/Q5500266","display_name":"Free monoid","level":3,"score":0.7981060743331909},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.7476481199264526},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.5699281692504883},{"id":"https://openalex.org/C119903167","wikidata":"https://www.wikidata.org/wiki/Q3321297","display_name":"Syntactic monoid","level":4,"score":0.5697759389877319},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5164730548858643},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5159576535224915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4973306953907013},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43712836503982544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42572182416915894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42553436756134033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3631948232650757},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13387447595596313},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054105003248","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003248","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.8090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.8090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://inf.informatik.uni-stuttgart.de/fmi/ti/personen/Lohrey/05-IJFCS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.4303","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.4303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://inf.informatik.uni-stuttgart.de/fmi/ti/personen/Lohrey/05-IJFCS.ps","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:127590","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/127590","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Developments in language theory : 8th international conference, DLT 2004, Auckland, New Zealand, December 13 - 17, 2004 ; proceedings / [vol. ed. Cristian S. Calude ...]<br/>8. International Conference Developments in Language Theory, DLT 2004, Auckland, New Zealand, 2004-12-13 - 2004-12-17","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W67045286","https://openalex.org/W1026721552","https://openalex.org/W1234885875","https://openalex.org/W1545078593","https://openalex.org/W1697762769","https://openalex.org/W1965022641","https://openalex.org/W1966217515","https://openalex.org/W1970379778","https://openalex.org/W1971416129","https://openalex.org/W1976522318","https://openalex.org/W1979328074","https://openalex.org/W1991636160","https://openalex.org/W1993901943","https://openalex.org/W2003865102","https://openalex.org/W2004459113","https://openalex.org/W2020079677","https://openalex.org/W2031613223","https://openalex.org/W2040480652","https://openalex.org/W2051700974","https://openalex.org/W2052794347","https://openalex.org/W2062170505","https://openalex.org/W2065701704","https://openalex.org/W2088663140","https://openalex.org/W2167918683","https://openalex.org/W2915052804","https://openalex.org/W3037175162","https://openalex.org/W4235484205","https://openalex.org/W4292101339","https://openalex.org/W4302964898","https://openalex.org/W6629884069"],"related_works":["https://openalex.org/W2111380805","https://openalex.org/W1515510498","https://openalex.org/W2087759875","https://openalex.org/W1517313330","https://openalex.org/W1564825853","https://openalex.org/W1503624973","https://openalex.org/W1489975931","https://openalex.org/W2583777943","https://openalex.org/W2075639491","https://openalex.org/W2002757726","https://openalex.org/W2137124862","https://openalex.org/W318121553","https://openalex.org/W2152236164","https://openalex.org/W2045561258","https://openalex.org/W2067945234","https://openalex.org/W3204506462","https://openalex.org/W2951847499","https://openalex.org/W1736615600","https://openalex.org/W2078618393","https://openalex.org/W2072374415"],"abstract_inverted_index":{"Several":[0],"complexity":[1],"and":[2,40],"decidability":[3],"results":[4],"for":[5,61],"automatic":[6,14,25,45],"monoids":[7],"are":[8],"shown:":[9],"(i)":[10],"there":[11,22,42],"exists":[12,23,43],"an":[13,24,44],"monoid":[15,26,46],"with":[16],"a":[17,73],"P-complete":[18],"word":[19,66],"problem,":[20],"(ii)":[21],"such":[27,47],"that":[28,48,60],"the":[29,33,51,65],"first-order":[30],"theory":[31],"of":[32,75],"corresponding":[34,52],"Cayley-graph":[35,53],"is":[36,54,58],"not":[37],"elementary":[38],"decidable,":[39],"(iii)":[41],"reachability":[49],"in":[50],"undecidable.":[55],"Moreover,":[56],"it":[57],"shown":[59],"every":[62],"hyperbolic":[63],"group":[64],"problem":[67],"belongs":[68],"to":[69],"LOGCFL,":[70],"which":[71],"improves":[72],"result":[74],"Cai":[76],"[8].":[77]},"counts_by_year":[],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}