A. Apostolico, R. Giancarlo, Pattern-matching machine implementation of a fast test for unique decipherability, Inform. Proc. Letters 18, 155--158, 1984. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Generalized Factorizations of Words and Their.. - Karhumäki, Plandowski.. (1998) (Correct)
....or (iii) synchronizing. In the case of F factorizations the property (i) characterizes when F is a code. Similarly, the notion (iii) is used to define synchronous codes, cf. 2] Each of the problems (i) iii) is known to be polynomial time solvable for F factorizations with F being finite, cf. [1, 2, 11]. For example, the unique decipherability problem is NL complete, cf. 10] and is equivalent via logspace reductions to the graph accessibility problem, GAP for short. We show that problems (i) and (iii) remain polynomial time solvable for quite a large extension of F factorizations, namely for ....
A. Apostolico, R. Giancarlo, Pattern-matching machine implementation of a fast test for unique decipherability, Inform. Proc. Letters 18, 155--158, 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC