I have to implement algorithm, where input and output go as follows:
Input:
Code,
Catenation of x1,x2,…,xn with respect to a merging function, where x1,x2,…,xn belong to a code - see example 2, page 4 from Directed figure codes are decidable by Michal Kolarz and Wlodzimierz Moczurad,
Catenation.
Output: x1,x2,…,xn
Please refer to the definitions of directed figure, catenation, and code in the paper mentioned above (pages 3,4,5, respectively).
My first task was to implement a catenation of directed figures which was easy, now I have to do similar problem, but backwards. I thought about this problem for two days, but nothing really comes to my mind. I had a few ideas but when I've thought about them deeper, they had some flaws in them. Any ideas about how this algorithms should look like would be appreciated.
Input:
Code,
Catenation of x1,x2,…,xn with respect to a merging function, where x1,x2,…,xn belong to a code - see example 2, page 4 from Directed figure codes are decidable by Michal Kolarz and Wlodzimierz Moczurad,
Catenation.
Output: x1,x2,…,xn
Please refer to the definitions of directed figure, catenation, and code in the paper mentioned above (pages 3,4,5, respectively).
My first task was to implement a catenation of directed figures which was easy, now I have to do similar problem, but backwards. I thought about this problem for two days, but nothing really comes to my mind. I had a few ideas but when I've thought about them deeper, they had some flaws in them. Any ideas about how this algorithms should look like would be appreciated.