TY  - JOUR

T1  - Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

JO  - Theoretical Computer Science

PY  - 2007/01/01

AU  - Danicic S

AU  - Harman M

AU  - Hierons R

AU  - Howroyd J

AU  - Laurence MR

ED  - 

DO  - DOI: 10.1016/j.tcs.2006.10.001

PB  - Elsevier BV

VL  - 373

IS  - 1-2

SP  - 1

EP  - 18

Y2  - 2024/12/22

ER  -