{"id":"https://openalex.org/W4252967799","doi":"https://doi.org/10.1142/s0129054119400355","title":"State Complexity of Suffix Distance","display_name":"State Complexity of Suffix Distance","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W4252967799","doi":"https://doi.org/10.1142/s0129054119400355"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054119400355","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400355","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/A5027656418","display_name":"Timothy Ng","orcid":"https://orcid.org/0000-0001-9980-6976"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Timothy Ng","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112711900","display_name":"David Rappaport","orcid":null},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"David Rappaport","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kai Salomaa","raw_affiliation_strings":["School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing, Queen\u2019s University, Kingston, Ontario K7L 3N6, Canada","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027656418"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31625938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"06n07","first_page":"1197","last_page":"1216"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/suffix","display_name":"Suffix","score":0.8197096586227417},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.7028478384017944},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6794543862342834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6455300450325012},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6231867671012878},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6127485036849976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5219911336898804},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5159964561462402},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4281264543533325},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.32033151388168335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21829715371131897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15123394131660461},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10980316996574402}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8197096586227417},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.7028478384017944},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6794543862342834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6455300450325012},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6231867671012878},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6127485036849976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5219911336898804},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5159964561462402},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4281264543533325},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.32033151388168335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21829715371131897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15123394131660461},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10980316996574402},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054119400355","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119400355","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":[{"score":0.6399999856948853,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W82544137","https://openalex.org/W1485181793","https://openalex.org/W1533036729","https://openalex.org/W1972572665","https://openalex.org/W2000290048","https://openalex.org/W2017724783","https://openalex.org/W2064749262","https://openalex.org/W2091300405","https://openalex.org/W2280220592","https://openalex.org/W2397866482","https://openalex.org/W2547353811","https://openalex.org/W2797999682","https://openalex.org/W4211010176","https://openalex.org/W4292003697","https://openalex.org/W4300958603"],"related_works":["https://openalex.org/W2022951409","https://openalex.org/W3196825089","https://openalex.org/W4368367671","https://openalex.org/W2413189204","https://openalex.org/W3012663989","https://openalex.org/W4385652842","https://openalex.org/W2773803767","https://openalex.org/W4381095475","https://openalex.org/W4318200119","https://openalex.org/W2356412146"],"abstract_inverted_index":{"The":[0],"neighbourhood":[1,42],"of":[2,26,40,43,48,71,89],"a":[3,19,81],"regular":[4,17],"language":[5,56],"with":[6,57],"respect":[7,58],"to":[8,59],"the":[9,23,37,41,60,64,86],"prefix,":[10],"suffix":[11,61,90],"and":[12,18,63,75],"subword":[13,65],"distance":[14,28,62,91],"is":[15,30],"always":[16],"tight":[20],"bound":[21,84],"for":[22,36,85],"state":[24,38,87],"complexity":[25,39,88],"prefix":[27],"neighbourhoods":[29],"known.":[31],"We":[32],"give":[33,80],"upper":[34],"bounds":[35],"radius":[44],"[Formula:":[45,50,72,76],"see":[46,51,73,77],"text]":[47,74,78],"an":[49],"text]-state":[52],"deterministic":[53],"finite":[54],"automaton":[55],"distance,":[66],"respectively.":[67],"For":[68],"restricted":[69],"values":[70],"we":[79],"matching":[82],"lower":[83],"neighbourhoods.":[92]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}