{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:44:26Z","timestamp":1726512266545},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"vor","delay-in-days":1490,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1016\/j.tcs.2016.05.018","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T19:37:03Z","timestamp":1464118623000},"page":"107-117","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["State complexity of prefix distance"],"prefix":"10.1016","volume":"679","author":[{"given":"Timothy","family":"Ng","sequence":"first","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.05.018_br0010","series-title":"Ukkonen Festschrift","first-page":"34","article-title":"Maximal words in sequence comparisons based on subword composition","volume":"vol. 6060","author":"Apostolico","year":"2010"},{"key":"10.1016\/j.tcs.2016.05.018_br0020","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","article-title":"Intersection and union of regular languages and state complexity","volume":"43","author":"Birget","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2016.05.018_br0030","first-page":"141","article-title":"Additive distances and quasi-distances between words","volume":"8","author":"Calude","year":"2002","journal-title":"J.UCS"},{"issue":"1","key":"10.1016\/j.tcs.2016.05.018_br0040","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0304-3975(01)00238-9","article-title":"Distances between languages and reflexivity of relations","volume":"286","author":"Choffrut","year":"2002","journal-title":"Theoret. Comput. Sci."},{"year":"2009","series-title":"Encyclopedia of Distances","author":"Deza","key":"10.1016\/j.tcs.2016.05.018_br0050"},{"key":"10.1016\/j.tcs.2016.05.018_br0060","article-title":"A survey on operational state complexity","author":"Gao","year":"2015","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.tcs.2016.05.018_br0070","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","article-title":"Descriptional and computational complexity of finite automata \u2014 a survey","volume":"209","author":"Holzer","year":"2011","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2016.05.018_br0080","first-page":"293","article-title":"Descriptional complexity of error\/edit systems","volume":"9","author":"Kari","year":"2004","journal-title":"J. Autom. Lang. Comb."},{"author":"Kari","key":"10.1016\/j.tcs.2016.05.018_br0090"},{"key":"10.1016\/j.tcs.2016.05.018_br0100","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1016\/j.ic.2007.06.001","article-title":"Computing the edit distance of a regular language","volume":"205","author":"Konstantinidis","year":"2007","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2016.05.018_br0110","series-title":"SOFSEM 2014: Theory and Practice of Computer Science","first-page":"419","article-title":"Parameterized prefix distance between regular languages","volume":"vol. 8327","author":"Kutrib","year":"2014"},{"key":"10.1016\/j.tcs.2016.05.018_br0120","first-page":"70","article-title":"Recent trends in descriptional complexity of formal languages","volume":"111","author":"Kutrib","year":"2013","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"10.1016\/j.tcs.2016.05.018_br0130","series-title":"Applied Combinatorics on Words","article-title":"Algorithms on words","volume":"vol. 105","author":"Lothaire","year":"2005"},{"key":"10.1016\/j.tcs.2016.05.018_br0140","series-title":"Descriptional Complexity of Formal Systems","first-page":"209","article-title":"Quasi-distances and weighted finite automata","volume":"vol. 9118","author":"Ng","year":"2015"},{"key":"10.1016\/j.tcs.2016.05.018_br0150","series-title":"Developments in Language Theory","first-page":"389","article-title":"State complexity of neighbourhoods and approximate pattern matching","volume":"vol. 9168","author":"Ng","year":"2015"},{"key":"10.1016\/j.tcs.2016.05.018_br0160","series-title":"Language and Automata Theory and Applications","first-page":"509","article-title":"Descriptive complexity of the Hamming neighborhood of a regular language","author":"Povarov","year":"2007"},{"issue":"06","key":"10.1016\/j.tcs.2016.05.018_br0170","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1142\/S0129054107005443","article-title":"State complexity of additive weighted finite automata","volume":"18","author":"Salomaa","year":"2007","journal-title":"Internat. J. Found. Comput. Sci."},{"year":"2009","series-title":"A Second Course in Formal Languages and Automata Theory","author":"Shallit","key":"10.1016\/j.tcs.2016.05.018_br0180"},{"key":"10.1016\/j.tcs.2016.05.018_br0190","series-title":"Handbook of Formal Languages","first-page":"41","article-title":"Regular languages","author":"Yu","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516301451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516301451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T01:12:33Z","timestamp":1622337153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516301451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":19,"alternative-id":["S0304397516301451"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.05.018","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2017,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"State complexity of prefix distance","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.05.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}