{"id":"https://openalex.org/W146566493","doi":"https://doi.org/10.25596/jalc-2002-377","title":"On the Combinatorial Alphabets of a Language","display_name":"On the Combinatorial Alphabets of a Language","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W146566493","doi":"https://doi.org/10.25596/jalc-2002-377","mag":"146566493"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2002-377","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-377","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2002-377","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030289114","display_name":"Daniel-Claudian Voinescu","orcid":null},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Voinescu, Daniel-Claudian","raw_affiliation_strings":["Faculty of Mathematics, University of Bucharest, 2 Riul Dorna block F1 apt 28, R-773441 Bucharest 6, Romania#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Bucharest, 2 Riul Dorna block F1 apt 28, R-773441 Bucharest 6, Romania#TAB#","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030289114"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02248934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"3","first_page":"377","last_page":"394"},"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/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/T12029","display_name":"DNA and Biological Computing","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7523999214172363},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.667298436164856},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.557035505771637},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5555703639984131},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5462439060211182},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5302937626838684},{"id":"https://openalex.org/keywords/analogy","display_name":"Analogy","score":0.5222102999687195},{"id":"https://openalex.org/keywords/combinatorial-design","display_name":"Combinatorial design","score":0.5056018829345703},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4968257248401642},{"id":"https://openalex.org/keywords/test-set","display_name":"Test set","score":0.4735000729560852},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4595564603805542},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.44136354327201843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3435496687889099},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09528496861457825},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.06310310959815979}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7523999214172363},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.667298436164856},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.557035505771637},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5555703639984131},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5462439060211182},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5302937626838684},{"id":"https://openalex.org/C521332185","wikidata":"https://www.wikidata.org/wiki/Q185816","display_name":"Analogy","level":2,"score":0.5222102999687195},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.5056018829345703},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4968257248401642},{"id":"https://openalex.org/C169903167","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Test set","level":2,"score":0.4735000729560852},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4595564603805542},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.44136354327201843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3435496687889099},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09528496861457825},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.06310310959815979},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.25596/jalc-2002-377","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-377","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"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-journal"},{"id":"mag:146566493","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jalc/jalc7.html#Voinescu02","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":{"id":"doi:10.25596/jalc-2002-377","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2002-377","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5199999809265137,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W46283434","https://openalex.org/W1973108096","https://openalex.org/W1996278077","https://openalex.org/W2020388226","https://openalex.org/W2052567887"],"related_works":["https://openalex.org/W3003757718","https://openalex.org/W3012034764","https://openalex.org/W1544170870","https://openalex.org/W3100134895","https://openalex.org/W2950760074","https://openalex.org/W2963062403","https://openalex.org/W1519919954","https://openalex.org/W2964212967","https://openalex.org/W3200027702","https://openalex.org/W2951597089","https://openalex.org/W2995201291","https://openalex.org/W2124005012","https://openalex.org/W2395504005","https://openalex.org/W2029134832","https://openalex.org/W2963053963","https://openalex.org/W2798622610","https://openalex.org/W107724628","https://openalex.org/W2173679018","https://openalex.org/W2282569116","https://openalex.org/W2945670815"],"abstract_inverted_index":{"The":[0,52],"combinatorial":[1,46,57,112,136,146],"degree":[2],"(or":[3],"dimension)":[4],"of":[5,31,48,54,59,78,107],"a":[6,10,45,92,108,110,126,132,135],"language":[7,50,88,124],"$L$":[8,60,89],"over":[9],"finite":[11,93,111,127],"alphabet":[12,47],"$\\Sigma$":[13],"is":[14,130],"the":[15,49,56,72,76,104],"positive":[16],"integer":[17],"$d(L)":[18],"=":[19,40],"\\min\\{\\card(A)":[20],"\\mid":[21],"A":[22,28],"\\subset":[23,26,36],"\\Sigma^*,":[24],"L":[25],"A^*\\}$.":[27],"subset":[29,128],"$A$":[30],"$\\Sigma^*$":[32],"for":[33,86],"which":[34,97,129],"$L":[35],"A^*$":[37],"and":[38,75,80,134,145,148],"$\\card(A)":[39],"d(L)$":[41],"will":[42,61,98],"be":[43,62,99],"called":[44],"$L$.":[51],"set":[53],"all":[55],"alphabets":[58],"denoted":[63],"by":[64,101],"$CA(L)$.":[65],"In":[66],"this":[67],"paper":[68],"we":[69,82,138,149],"shall":[70,83,119,139,150],"establish":[71],"main":[73],"properties":[74],"structure":[77],"$CA(L)$":[79],"also":[81,121],"prove":[84,120],"that":[85,116,122],"every":[87],"there":[90],"exists":[91],"part":[94],"$L_f$":[95],"--":[96,114],"called,":[100],"analogy":[102],"with":[103],"famous":[105],"notion":[106],"test-set,":[109,137],"test-set":[113,133],"such":[115],"$CA(L)=CA(L_f)$.":[117],"We":[118],"each":[123],"has":[125],"simultaneously":[131],"highlight":[140],"some":[141,152],"relations":[142],"between":[143],"test-sets":[144,147],"give":[151],"interesting":[153],"examples.":[154]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}