{"id":"https://openalex.org/W2806339071","doi":"https://doi.org/10.37236/7932","title":"Classifying Rotationally-Closed Languages Having Greedy Universal Cycles","display_name":"Classifying Rotationally-Closed Languages Having Greedy Universal Cycles","publication_year":2019,"publication_date":"2019-03-08","ids":{"openalex":"https://openalex.org/W2806339071","doi":"https://doi.org/10.37236/7932","mag":"2806339071"},"language":"en","primary_location":{"id":"doi:10.37236/7932","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7932","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p35/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063565029","display_name":"Joseph DiMuro","orcid":null},"institutions":[{"id":"https://openalex.org/I152479009","display_name":"Biola University","ror":"https://ror.org/02han2n82","country_code":"US","type":"education","lineage":["https://openalex.org/I152479009"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph DiMuro","raw_affiliation_strings":["Biola University"],"affiliations":[{"raw_affiliation_string":"Biola University","institution_ids":["https://openalex.org/I152479009"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063565029"],"corresponding_institution_ids":["https://openalex.org/I152479009"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00462438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9968000054359436,"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.9836999773979187,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8041672706604004},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7164420485496521},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6853422522544861},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.655113697052002},{"id":"https://openalex.org/keywords/append","display_name":"Append","score":0.6451729536056519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6229860782623291},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.4760054051876068},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43023058772087097},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4278194308280945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39729997515678406},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19704276323318481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19247382879257202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1876513957977295},{"id":"https://openalex.org/keywords/mathematical-physics","display_name":"Mathematical physics","score":0.04816994071006775}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8041672706604004},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7164420485496521},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6853422522544861},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.655113697052002},{"id":"https://openalex.org/C2777998813","wikidata":"https://www.wikidata.org/wiki/Q16869124","display_name":"Append","level":2,"score":0.6451729536056519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6229860782623291},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.4760054051876068},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43023058772087097},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4278194308280945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39729997515678406},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19704276323318481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19247382879257202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1876513957977295},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.04816994071006775},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/7932","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7932","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1805.11641","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.11641","pdf_url":"https://arxiv.org/pdf/1805.11641","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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"},{"id":"mag:2806339071","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1805.11641.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1805.11641","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1805.11641","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/7932","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7932","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p35/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2806339071.pdf","grobid_xml":"https://content.openalex.org/works/W2806339071.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2135806834","https://openalex.org/W2290281988","https://openalex.org/W2894564506","https://openalex.org/W6629582371"],"related_works":["https://openalex.org/W3000219546","https://openalex.org/W2739605728","https://openalex.org/W2006528273","https://openalex.org/W1975861344","https://openalex.org/W2971615589","https://openalex.org/W2337640854","https://openalex.org/W2018403675","https://openalex.org/W2239938932","https://openalex.org/W2522105484","https://openalex.org/W1508973658","https://openalex.org/W2951256320","https://openalex.org/W2951396963","https://openalex.org/W2950292719","https://openalex.org/W2913952852","https://openalex.org/W1638014518","https://openalex.org/W2954165952","https://openalex.org/W2053244702","https://openalex.org/W2952369582","https://openalex.org/W1811426704","https://openalex.org/W3113681183"],"abstract_inverted_index":{"Let":[0],"$\\textbf{T}(n,k)$":[1,18],"be":[2,20],"the":[3,11,28,34],"set":[4],"of":[5,7,42],"strings":[6],"length":[8,43],"$n$":[9],"over":[10],"alphabet":[12],"$\\Sigma=\\{1,2,\\ldots,k\\}$.":[13],"A":[14],"universal":[15,49],"cycle":[16],"for":[17,51],"can":[19],"constructed":[21],"using":[22],"a":[23,40],"greedy":[24],"algorithm:":[25],"start":[26],"with":[27],"string":[29],"$k^n$,":[30],"and":[31],"continually":[32],"append":[33],"least":[35],"symbol":[36],"possible":[37],"without":[38],"repeating":[39],"substring":[41],"$n$.":[44],"This":[45],"construction":[46],"also":[47],"creates":[48],"cycles":[50],"some":[52],"subsets":[53,60],"$\\textbf{S}\\subseteq\\textbf{T}(n,k)$;":[54],"we":[55],"will":[56],"classify":[57],"all":[58],"such":[59],"that":[61],"are":[62],"closed":[63],"under":[64],"rotations.":[65]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}