{"id":"https://openalex.org/W811767192","doi":null,"title":"Some Regular Languages and Prefix Coding","display_name":"Some Regular Languages and Prefix Coding","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W811767192","mag":"811767192"},"language":"en","primary_location":{"id":"mag:2252414143","doi":null,"is_oa":false,"landing_page_url":"https://www.dbpia.co.kr/Article/NODE00580235","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5051953152","display_name":"Mordecai J. Golin","orcid":"https://orcid.org/0000-0002-1260-6574","observed_orcids":["https://orcid.org/0000-0002-1260-6574"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mordecai J. Golin","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1260-6574","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5059099525","display_name":"Hyeon-Suk Na","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\ub098\ud604\uc219","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3738,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62464455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.551800012588501,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.551800012588501,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/T11567","display_name":"semigroups and automata theory","score":0.44780001044273376,"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/T11130","display_name":"Coding theory and cryptography","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/prefix-free-codes","display_name":"prefix-free codes","score":0.8230000138282776},{"id":"https://openalex.org/keywords/optimal-prefix-codes","display_name":"optimal prefix codes","score":0.6729999780654907},{"id":"https://openalex.org/keywords/regular-languages","display_name":"regular languages","score":0.9449999928474426},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.3700000047683716},{"id":"https://openalex.org/keywords/code-structure","display_name":"code structure","score":0.3959999978542328}],"concepts":[{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.9610848426818848},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.8952515721321106},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.6770018339157104},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5519353151321411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5172137022018433},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.498690128326416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43302661180496216},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.4278717339038849},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4236312806606293},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4193783402442932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3349366784095764},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.32800501585006714},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32261747121810913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29454106092453003},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2659240663051605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25958603620529175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24937352538108826},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.20310673117637634},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1659221351146698},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15456071496009827},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.09493577480316162},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09300494194030762},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.05636078119277954},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.043735116720199585},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2252414143","doi":null,"is_oa":false,"landing_page_url":"https://www.dbpia.co.kr/Article/NODE00580235","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","raw_type":null},{"id":"mag:811767192","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=GCSHCI_2005_v30n2C_1","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Journal of Korean Institute of Communications and Information Sciences","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1518945656","https://openalex.org/W2252414143","https://openalex.org/W1900502507","https://openalex.org/W7113419473","https://openalex.org/W271010423","https://openalex.org/W7097255896","https://openalex.org/W2000929884","https://openalex.org/W7097840805","https://openalex.org/W7096668768","https://openalex.org/W3010372245"],"abstract_inverted_index":{"Code":[0],"is":[1,16,23],"a":[2,48,55],"set":[3],"of":[4,10,19,42,44,51,66,83],"words.":[5,46],"If,":[6],"for":[7],"any":[8],"pair":[9],"words":[11],"in":[12,62,75],"the":[13,21,40,81],"code,":[14],"one":[15],"not":[17],"prefix":[18,28,73],"another,":[20],"code":[22,38,71],"called":[24],"Prefix(-Free)":[25],"Code.":[26],"The":[27],"coding":[29],"problem":[30],"is,":[31],"given":[32,59],"n,":[33],"to":[34,57],"find":[35],"an":[36,69],"optimal":[37,70,84],"with":[39],"minimum-sum":[41],"lengths":[43],"n":[45,88],"As":[47],"special":[49],"case":[50],"this,":[52],"we":[53],"present":[54],"method":[56],"find,":[58],"language":[60],"L":[61],"some":[63],"specific":[64],"classes":[65],"regular":[67],"languages,":[68],"among":[72],"codes":[74,85],"L.":[76],"We":[77],"also":[78],"show":[79],"how":[80],"structure":[82],"varies":[86],"as":[87],"grows,":[89],"using":[90],"trees.":[91]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}