{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:40:52Z","timestamp":1697956852644},"reference-count":11,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"vor","delay-in-days":8282,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems & Computers in Japan"],"published-print":{"date-parts":[[1985,1]]},"abstract":"Abstract<\/jats:title>As models to describe concurrent systems, Petri net, shuffle stack automaton (SSA), flow expression, event expression, and shuffle grammar have been proposed. SSA is an automaton which is obtained by adding to the finite automaton a stack with shuffle function. Its descriptive power has already been discussed. This paper discusses the real\u2010time shuffle stack automaton (RSSA, which is an SSA without \u03bb\u2010transition in regard to the input), which is a subclass of SSA. It is shown that RSSA has the same descriptive power, independently of the accepting mode (empty\u2010stack acceptance or final\u2010state acceptance), and of whether or not a terminating symbol is provided at the end of the input string. It is also shown that the descriptive power of RSSA is incomparable to that of the push\u2010down automaton, but is properly contained in that of the linear bounded automaton. If a language is bounded and if the set obtained by applying Parikh mapping to that language is semi\u2010linear, the language is accepted by RSSA. Another property of the language accepted by RSSA is that if it is a bounded context\u2010free language, it is accepted by RSSA.<\/jats:p>","DOI":"10.1002\/scj.4690160204","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T09:48:12Z","timestamp":1183801692000},"page":"29-37","source":"Crossref","is-referenced-by-count":0,"title":["Real\u2010time shuffle stack automaton"],"prefix":"10.1002","volume":"16","author":[{"given":"Shoji","family":"Kosai","sequence":"first","affiliation":[]},{"given":"Yoshihiro","family":"Tsujino","sequence":"additional","affiliation":[]},{"given":"Toshiro","family":"Araki","sequence":"additional","affiliation":[]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,9,5]]},"reference":[{"issue":"8","key":"e_1_2_1_2_2","first-page":"909","article-title":"Shuffle grammars","volume":"66","author":"Araki T.","year":"1983","journal-title":"Trans. (D), I.E.C.E., Japan"},{"issue":"9","key":"e_1_2_1_3_2","first-page":"1024","article-title":"Shuffle stack automaton","volume":"66","author":"Arakai T.","year":"1983","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_4_2","volume-title":"The Mathematical Theory of Context\u2010Free Languages","author":"Glnsburg S.","year":"1966"},{"issue":"12","key":"e_1_2_1_5_2","first-page":"1408","article-title":"Linear shuffle grammars and some properties of languages generated by shuffle grammars","volume":"66","author":"Kosai S.","year":"1983","journal-title":"Trans. (D), I.E.C.E., Japan"},{"issue":"3","key":"e_1_2_1_6_2","first-page":"327","article-title":"Shuffle grammars with synchronization mechanism","volume":"67","author":"Kosai S.","year":"1984","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_7_2","first-page":"28","volume-title":"Nat. Conv. Inf. and Systems","author":"Kosai S.","year":"1983"},{"key":"e_1_2_1_8_2","volume-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson J.L.","year":"1981"},{"issue":"1","key":"e_1_2_1_9_2","article-title":"An approach to software system behavior description","volume":"4","author":"Riddle W.E.","year":"1979","journal-title":"Computer Languages"},{"issue":"3","key":"e_1_2_1_10_2","article-title":"Software descriptions with flow expressions","volume":"4","author":"Shaw A.C.","year":"1978","journal-title":"I.E.E.E. Trans. Software Engineering"},{"issue":"6","key":"e_1_2_1_11_2","first-page":"541","article-title":"Regular expressions with shuffle and shuffle closure operators","volume":"64","author":"Tsujino Y.","year":"1981","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_12_2","unstructured":"Y.Tsujino T.ArakiandN.Tokura.Some subclasses of shuffle stack automaton Nat. Conv. I.E.C.E. Japan 1340(1983)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690160204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690160204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T12:53:21Z","timestamp":1697892801000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690160204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["10.1002\/scj.4690160204"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690160204","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}