# tms - δ q,c q q 1 R q 1 q 2 a R q 2 q 3 L q 3 q 5 R q 4 b...

This preview shows page 1. Sign up to view the full content.

Computer Science E-207 A Formal Description of a Turing Machine Problem Give the seven-tuple for a Turing machine, M , that loops forever, counting up all strings in { a,b,c } * lexicographically ( i.e. , in “dictionary order”). Solution M = ( K, Σ ,δ,q 0 ,q 7 ,q 7 ), where K = { q 0 ,q 1 ,q 2 ,q 3 ,q 4 ,q 5 ,q 6 ,q 7 } , Σ = , Γ = { [ , ] , t ,a,b,c } , and δ given by the following table: q δ ( q, [) δ ( q, ]) δ ( q, t ) δ ( q,a ) δ ( q,b
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ) δ ( q,c ) q ( q 1 ,[, R) q 1 ( q 2 , a , R) q 2 ( q 3 ,], L) q 3 ( q 5 ,[, R) ( q 4 , b , R) ( q 4 , c , R) ( q 3 , a , L) q 4 ( q 3 ,], L) ( q 4 , a , R) ( q 4 , b , R) ( q 4 , c , R) q 5 ( q 6 , a , R) ( q 5 , a , R) q 6 ( q 3 ,], L) q 7 Note: all unspeciﬁed transitions end up in q 7 ....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online