Analysis of Different Methods to Solve a Problem L = Anb2n for All N > = 1 Using a Turing Machine in Terms of Their Complexity
Transactions on Machine Design (TMD)
doi 10.6025/pms/2018/7/2/72-81
Full Text
Open PDFAbstract
Available in full text
Date
August 1, 2018
Authors
Publisher
Digital Information Research Foundation