... A P - complete language describable with iterated shuffle . In- formation Processing Letters 41 ( 5 ) , 233–238 ... languages . Journal of the Association of Computing Machinery 25 , 405- 415 ( 1978 ) Venkateswaran , H ...
... shuffle: Circuits and graphs, Journal of Discrete Algorithms 31, 0, pp. 120 – 128, doi:http://dx.doi.org ... A P-complete language describable with iterated shuffle, Information Processing Letters 41, 5, pp. 233–238. Shustek ...
... language such that any ( finite ) word can be factorized by ( written as a ... shuffle ' product appears to be of utmost interest . All the results are in ... P. Jantke [ Elektron . Informationsverarb . Kybernet . 15 ( 1979 ) ...
... p. 242–254. Shoudai T. (1992). A P-complete language describable with iterated shuffle, Information Processing Letters 41,5, p. 233–238. Shustek, L. (2009). Interview, Communications of the ACM 52, 3, pp. 38–41. Singh S. (1999). The ...
... shuffle closure operator . Information Processing Letters 28 ( 1988 ) 33-37 [ 11 ] J. JĘDRZEJowicz : An undecidable problem for shuffle languages . Developments in Language ... P. Theoretical Computer Science 250 ( 2001 ) 31-53 [ 14 ] J. E. ...