{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:08:38Z","timestamp":1719940118542},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,12]]},"abstract":" In this paper, we study the state complexities of two particular combinations of operations: catenation combined with union and catenation combined with intersection. We show that the state complexity of the former combined operation is considerably less than the mathematical composition of the state complexities of catenation and union, while the state complexity of the latter one is equal to the mathematical composition of the state complexities of catenation and intersection. <\/jats:p>","DOI":"10.1142\/s0129054111009045","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T12:46:00Z","timestamp":1326199560000},"page":"1797-1812","source":"Crossref","is-referenced-by-count":12,"title":["STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION"],"prefix":"10.1142","volume":"22","author":[{"given":"BO","family":"CUI","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, Canada"}]},{"given":"YUAN","family":"GAO","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, Canada"}]},{"given":"LILA","family":"KARI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, Canada"}]},{"given":"SHENG","family":"YU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7, Canada"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01371727"},{"key":"rf3","first-page":"455","volume":"7","author":"Domaratzki M.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.025"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.026"},{"key":"rf6","first-page":"75","volume":"83","author":"Gao Y.","journal-title":"Fundam. Inform."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.054"},{"key":"rf10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003133"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.011"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.03.018"},{"key":"rf15","first-page":"1373","volume":"11","author":"Maslov A. N.","journal-title":"Soviet Mathematics Doklady"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410200100X"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.06.011"},{"key":"rf18","first-page":"293","volume":"320","author":"Salomaa A.","journal-title":"Theoretical Computer Science"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.015"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)00011-F"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"rf22","first-page":"221","volume":"6","author":"Yu S.","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111009045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:13:11Z","timestamp":1565129591000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111009045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":18,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S0129054111009045"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111009045","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}
