{"id":"https://openalex.org/W2082796216","doi":"https://doi.org/10.1142/s0129054108006169","title":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","display_name":"STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W2082796216","doi":"https://doi.org/10.1142/s0129054108006169","mag":"2082796216"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054108006169","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108006169","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/A5021282163","display_name":"Cezar C\u00e2mpeanu","orcid":"https://orcid.org/0000-0002-9777-3012"},"institutions":[{"id":"https://openalex.org/I22188714","display_name":"University of Prince Edward Island","ror":"https://ror.org/02xh9x144","country_code":"CA","type":"education","lineage":["https://openalex.org/I22188714"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"CEZAR C\u00c2MPEANU","raw_affiliation_strings":["Department of Computer Science and Information Technology, The University of Prince Edward Island, 550 University Avenue, Charlottetown, PE, C1A 4P3, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, The University of Prince Edward Island, 550 University Avenue, Charlottetown, PE, C1A 4P3, Canada","institution_ids":["https://openalex.org/I22188714"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046508856","display_name":"Stavros Konstantinidis","orcid":"https://orcid.org/0000-0002-6628-067X"},"institutions":[{"id":"https://openalex.org/I66890659","display_name":"Saint Mary's University","ror":"https://ror.org/010zh7098","country_code":"CA","type":"education","lineage":["https://openalex.org/I66890659"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"STAVROS KONSTANTINIDIS","raw_affiliation_strings":["Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, B3H 3C3, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, B3H 3C3, Canada","institution_ids":["https://openalex.org/I66890659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021282163"],"corresponding_institution_ids":["https://openalex.org/I22188714"],"apc_list":null,"apc_paid":null,"fwci":0.1347,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5437448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"05","first_page":"1099","last_page":"1112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9994000196456909,"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/closure","display_name":"Closure (psychology)","score":0.7277907133102417},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6331233978271484},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5806142091751099},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5653306245803833},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5637542009353638},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5460115671157837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5449929237365723},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5230013728141785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4619024693965912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39312151074409485},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38698309659957886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3815458416938782},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.15594452619552612},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1258549690246582}],"concepts":[{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7277907133102417},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6331233978271484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5806142091751099},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5653306245803833},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5637542009353638},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5460115671157837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5449929237365723},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5230013728141785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4619024693965912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39312151074409485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38698309659957886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3815458416938782},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.15594452619552612},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1258549690246582},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054108006169","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108006169","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W156540454","https://openalex.org/W1486150282","https://openalex.org/W1489604929","https://openalex.org/W1516283971","https://openalex.org/W1552018910","https://openalex.org/W1574005495","https://openalex.org/W1584587517","https://openalex.org/W1711504524","https://openalex.org/W2099378738","https://openalex.org/W2740103984","https://openalex.org/W2913383557","https://openalex.org/W4211010176"],"related_works":["https://openalex.org/W315394019","https://openalex.org/W2923398117","https://openalex.org/W4309585848","https://openalex.org/W2265383332","https://openalex.org/W4328130279","https://openalex.org/W2002342158","https://openalex.org/W2105009749","https://openalex.org/W4299387245","https://openalex.org/W583262921","https://openalex.org/W2036721792"],"abstract_inverted_index":{"We":[0,68,103],"are":[1,10],"interested":[2],"in":[3,45,55,63],"the":[4,13,28,41,86,106,115],"state":[5,87,107],"complexity":[6,88,108],"of":[7,20,24,30,38,40,49,89,109,114],"languages":[8],"that":[9,96],"defined":[11],"via":[12],"subword":[14,18,37,91,116],"closure":[15,19,117],"operation.":[16,118],"The":[17],"a":[21,70,81,90],"set":[22,29],"S":[23],"fixed-length":[25],"words":[26,32],"is":[27,44,99],"all":[31],"w":[33,39],"for":[34],"which":[35],"any":[36],"fixed":[42],"length":[43],"S.":[46],"This":[47],"type":[48],"constraint":[50],"appears":[51],"to":[52,59,65,74],"be":[53],"useful":[54],"various":[56],"situations":[57],"related":[58,73,112],"data":[60],"encodings":[61],"and":[62,94],"particular":[64,78],"DNA":[66,110],"encodings.":[67],"present":[69],"few":[71],"results":[72],"this":[75,97],"concept.":[76],"In":[77],"we":[79],"give":[80],"general":[82],"upper":[83],"bound":[84,98],"on":[85],"closed":[92],"language":[93],"show":[95],"tight":[100],"infinitely":[101],"often.":[102],"also":[104],"discuss":[105],"computing":[111],"cases":[113]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}