{"id":"https://openalex.org/W1965769371","doi":"https://doi.org/10.1142/s0129054111008064","title":"POWERS OF REGULAR LANGUAGES","display_name":"POWERS OF REGULAR LANGUAGES","publication_year":2011,"publication_date":"2011-02-01","ids":{"openalex":"https://openalex.org/W1965769371","doi":"https://doi.org/10.1142/s0129054111008064","mag":"1965769371"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054111008064","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008064","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/A5070139768","display_name":"Szil\u00e1rd Zsolt Fazekas","orcid":"https://orcid.org/0000-0001-5319-0395"},"institutions":[{"id":"https://openalex.org/I4210141873","display_name":"University of Ny\u00edregyh\u00e1za","ror":"https://ror.org/03zax1057","country_code":"HU","type":"education","lineage":["https://openalex.org/I4210141873"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"SZIL\u00c1RD ZSOLT FAZEKAS","raw_affiliation_strings":["Faculty of Natural Sciences, University College of Ny\u00edregyh\u00e1za, S\u00f3st\u00f3i \u00fat 31/B, Ny\u00edregyh\u00e1za, 4400, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Natural Sciences, University College of Ny\u00edregyh\u00e1za, S\u00f3st\u00f3i \u00fat 31/B, Ny\u00edregyh\u00e1za, 4400, Hungary","institution_ids":["https://openalex.org/I4210141873"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070139768"],"corresponding_institution_ids":["https://openalex.org/I4210141873"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.06419599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"02","first_page":"323","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9977999925613403,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.982699990272522,"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/regular-language","display_name":"Regular language","score":0.8433864116668701},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8211729526519775},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7925567626953125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.669109582901001},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6041598916053772},{"id":"https://openalex.org/keywords/abstract-family-of-languages","display_name":"Abstract family of languages","score":0.5291334390640259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.500662088394165},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.49271443486213684},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4743413031101227},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4257257580757141},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3583085536956787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24164894223213196},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.22284314036369324},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13113760948181152},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07773840427398682},{"id":"https://openalex.org/keywords/second-generation-programming-language","display_name":"Second-generation programming language","score":0.06586635112762451}],"concepts":[{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.8433864116668701},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8211729526519775},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7925567626953125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.669109582901001},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6041598916053772},{"id":"https://openalex.org/C199163288","wikidata":"https://www.wikidata.org/wiki/Q3065587","display_name":"Abstract family of languages","level":5,"score":0.5291334390640259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.500662088394165},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.49271443486213684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4743413031101227},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4257257580757141},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3583085536956787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24164894223213196},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.22284314036369324},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13113760948181152},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07773840427398682},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.06586635112762451},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054111008064","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054111008064","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":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1559698152","https://openalex.org/W1739819140","https://openalex.org/W2054801208","https://openalex.org/W2286290063"],"related_works":["https://openalex.org/W4210507006","https://openalex.org/W1971747251","https://openalex.org/W1479975624","https://openalex.org/W2613180196","https://openalex.org/W2561015286","https://openalex.org/W2964542290","https://openalex.org/W2280368318","https://openalex.org/W4376863261","https://openalex.org/W2281054049","https://openalex.org/W2998521476"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,15],"prove":[4],"that":[5,82],"it":[6],"is":[7,31],"decidable":[8],"whether":[9],"the":[10,20,24,68,83,92],"set":[11],"pow":[12],"(L),":[13],"which":[14,73,86,94],"get":[16],"by":[17,40,51,57],"taking":[18],"all":[19,23],"powers":[21,69],"of":[22,64],"words":[25],"in":[26,44],"some":[27],"regular":[28,32,71,84,89],"language":[29],"L,":[30],"or":[33],"not.":[34],"The":[35],"problem":[36],"was":[37],"originally":[38],"posed":[39],"Calbrix":[41],"and":[42,56,70],"Nivat":[43],"1995.":[45],"Partial":[46],"solutions":[47],"have":[48,74,87],"been":[49],"given":[50],"Cachat":[52],"for":[53,61,67],"unary":[54],"languages":[55,72,85],"Horv\u00e1th":[58],"et":[59],"al.":[60],"various":[62],"kinds":[63],"exponent":[65],"sets":[66],"primitive":[75],"roots":[76],"satisfying":[77],"certain":[78],"properties.":[79],"We":[80],"show":[81],"a":[88],"power":[90],"are":[91,95],"ones":[93],"'almost'":[96],"equal":[97],"to":[98],"their":[99],"Kleene-closure.":[100]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}