{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:37:58Z","timestamp":1648539478192},"reference-count":20,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,8]]},"abstract":"<jats:p> We consider the state complexity of several combined operations. Those results show that the state complexity of a combined operation is in general very different from the composition of the state complexities of the participating individual operations. We also consider general estimation methods for the state complexity of combined operations. In particular, estimation through nondeterministic state complexity is studied. It is shown that the method is very promising for a large class of combined operations. <\/jats:p>","DOI":"10.1142\/s0129054107004917","type":"journal-article","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T07:29:46Z","timestamp":1185780586000},"page":"683-698","source":"Crossref","is-referenced-by-count":23,"title":["ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION"],"prefix":"10.1142","volume":"18","author":[{"given":"KAI","family":"SALOMAA","sequence":"first","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario, Canada K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHENG","family":"YU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, CANADA N6A 5B7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90160-U"},{"key":"rf4","first-page":"303","volume":"7","author":"C\u00e2mpeanu C.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf5","doi-asserted-by":"crossref","unstructured":"C.\u00a0C\u00e2mpeanu, K.\u00a0Salomaa and S.\u00a0Yu, Finite vs Infinite \u2013 Contributions to an Eternal Dilemma, eds. C.\u00a0Calude and G.\u00a0Paun (Springer, 2000)\u00a0pp. 53\u201373.","DOI":"10.1007\/978-1-4471-0751-4_5"},{"key":"rf6","first-page":"455","volume":"7","author":"Domaratzki M.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf7","first-page":"233","volume":"9","author":"Ellul K.","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"rf9","volume-title":"Modeling Reactive Systems with Statecharts","author":"Harel D.","year":"1998"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103002199"},{"key":"rf12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00029-3"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.011"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003133"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(81)80005-9"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410200100X"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.06.011"},{"key":"rf22","volume-title":"Theory of Automata","author":"Salomaa A.","year":"1969"},{"key":"rf24","first-page":"293","volume":"320","author":"Salomaa A.","journal-title":"Theoretical Computer Science"},{"key":"rf25","first-page":"177","volume":"2","author":"Salomaa K.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"rf27","first-page":"221","volume":"6","author":"Yu S.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)00011-F"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107004917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:42:14Z","timestamp":1565124134000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107004917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":20,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,8]]}},"alternative-id":["10.1142\/S0129054107004917"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107004917","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}