@article{article, title  = {{Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time}},

 publisher = {{Elsevier BV}},

 url = {{https://doi.org/10.1016/j.tcs.2006.10.001 }},

 year = {{2007}},

 month = {{3}},

 author = {{Danicic S and Harman M and Hierons R and Howroyd J and Laurence MR}},

 doi = {{10.1016/j.tcs.2006.10.001}},

 volume = {{373}},

 journal = {{Theoretical Computer Science}},

 issue = {{1-2}},

 pages = {{1-18}},

 note = {{Accessed on 2025/11/05}}}