TY - JOUR

T1 - Corrigendum

T2 - “On the computing powers of L-reductions of insertion languages” (Theoretical Computer Science (2021) 862 (224–235), (S030439752030668X), (10.1016/j.tcs.2020.11.029))

AU - Okubo, Fumiya

AU - Yokomori, Takashi

N1 - Publisher Copyright:
© 2020 Elsevier B.V.

PY - 2022/6/12

Y1 - 2022/6/12

N2 - The authors regret that the proof for Theorem 4 in the article “On the computing powers of [Formula presented]-reductions of insertion languages” was incomplete, which was pointed out by Kaoru Fujioka, Fukuoka Women's University, Japan. The proof needs some supplementary corrections for constructing the insertion system γ and [Formula presented]. Specifically, in the proof (on page 231), 1. line 4: Correct as [Formula presented], we construct the following rules: [Formula presented] 3. after line 11: Insert the following: • If there exists a rule

AB - The authors regret that the proof for Theorem 4 in the article “On the computing powers of [Formula presented]-reductions of insertion languages” was incomplete, which was pointed out by Kaoru Fujioka, Fukuoka Women's University, Japan. The proof needs some supplementary corrections for constructing the insertion system γ and [Formula presented]. Specifically, in the proof (on page 231), 1. line 4: Correct as [Formula presented], we construct the following rules: [Formula presented] 3. after line 11: Insert the following: • If there exists a rule

UR - http://www.scopus.com/inward/record.url?scp=85130213772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85130213772&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2021.06.028

DO - 10.1016/j.tcs.2021.06.028

M3 - Comment/debate

AN - SCOPUS:85130213772

SN - 0304-3975

VL - 920

SP - 113

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -