{"id":"https://openalex.org/W4280559572","doi":"https://doi.org/10.1142/s0129054122410040","title":"Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata","display_name":"Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata","publication_year":2022,"publication_date":"2022-04-01","ids":{"openalex":"https://openalex.org/W4280559572","doi":"https://doi.org/10.1142/s0129054122410040"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054122410040","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122410040","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/A5071162952","display_name":"Kitti Gelle","orcid":null},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Kitti Gelle","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072375064","display_name":"Szabolcs Iv\u00e1n","orcid":"https://orcid.org/0000-0003-0406-7117"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Szabolcs Iv\u00e1n","raw_affiliation_strings":["Department of Computer Science, University of Szeged, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Szeged, Hungary","institution_ids":["https://openalex.org/I227486990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071162952","https://openalex.org/A5072375064"],"corresponding_institution_ids":["https://openalex.org/I227486990"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04303998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"03n04","first_page":"247","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.713187038898468},{"id":"https://openalex.org/keywords/congruence","display_name":"Congruence (geometry)","score":0.6415333151817322},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6281741857528687},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5140708684921265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49289512634277344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48019349575042725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47288671135902405},{"id":"https://openalex.org/keywords/finitely-generated-abelian-group","display_name":"Finitely-generated abelian group","score":0.43562155961990356},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.295776903629303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27218058705329895}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.713187038898468},{"id":"https://openalex.org/C132074034","wikidata":"https://www.wikidata.org/wiki/Q154210","display_name":"Congruence (geometry)","level":2,"score":0.6415333151817322},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6281741857528687},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5140708684921265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49289512634277344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48019349575042725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47288671135902405},{"id":"https://openalex.org/C162860070","wikidata":"https://www.wikidata.org/wiki/Q142140","display_name":"Finitely-generated abelian group","level":2,"score":0.43562155961990356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.295776903629303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27218058705329895},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054122410040","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122410040","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8700000047683716,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W124851435","https://openalex.org/W1490320195","https://openalex.org/W1567676570","https://openalex.org/W1991075325","https://openalex.org/W1999333609","https://openalex.org/W2028402257","https://openalex.org/W2030769814","https://openalex.org/W2051404975","https://openalex.org/W2092386826","https://openalex.org/W2105259569","https://openalex.org/W2115757125","https://openalex.org/W2130741488","https://openalex.org/W2136462002","https://openalex.org/W2160990400","https://openalex.org/W2172255023","https://openalex.org/W2296048670","https://openalex.org/W2618060440","https://openalex.org/W2621376207","https://openalex.org/W2747254125","https://openalex.org/W2764347725","https://openalex.org/W3140881457","https://openalex.org/W3141808588","https://openalex.org/W4233798822","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2388471861","https://openalex.org/W2354789018","https://openalex.org/W2391316944","https://openalex.org/W4380684998","https://openalex.org/W4226251895","https://openalex.org/W2009813083","https://openalex.org/W2049702451","https://openalex.org/W2573882791","https://openalex.org/W2089148617","https://openalex.org/W2798603509"],"abstract_inverted_index":{"Reversible":[0],"forms":[1],"of":[2,12,104],"computations":[3],"are":[4,41,78],"often":[5],"interesting":[6],"from":[7],"an":[8,21],"energy":[9],"efficiency":[10],"point":[11],"view.":[13],"When":[14],"the":[15,27,62,74,85,95,102],"computation":[16],"device":[17],"in":[18,73],"question":[19],"is":[20,24,35,66],"automaton,":[22],"it":[23],"known":[25],"that":[26,61,71],"minimal":[28,96],"reversible":[29,46,83],"automaton":[30],"recognizing":[31],"a":[32],"given":[33],"language":[34],"not":[36],"necessarily":[37],"unique,":[38],"moreover,":[39],"there":[40,77],"languages":[42],"having":[43],"arbitrarily":[44],"large":[45],"recognizers":[47],"possessing":[48],"no":[49],"nontrivial":[50],"\u201creversible\u201d":[51],"congruence.":[52],"Building":[53],"atop":[54],"on":[55],"our":[56],"earlier":[57],"result,":[58],"we":[59],"show":[60],"corresponding":[63],"decision":[64],"problem":[65],"[Formula:":[67],"see":[68],"text]-complete,":[69],"and":[70],"even":[72],"case":[75,103],"when":[76],"only":[79],"finitely":[80],"many":[81],"such":[82],"recognizers,":[84],"largest":[86],"one":[87],"among":[88],"them":[89],"can":[90],"be":[91],"exponentially":[92],"larger":[93],"than":[94],"automaton.":[97],"Both":[98],"results":[99],"hold":[100],"for":[101],"binary":[105],"alphabets.":[106]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
