A two-tape Turing machine that accepts strings of the languag... on Twitpic

Binary Adder

Senior at The University of Scranton. Computer science student. Complainer. PHP lover. Nerd. Atheist. Genuine asshole. Obese. Loves burritos.

$A two-tape Turing machine that accepts strings of the language L = {a^nb^nc^n | n > 0}.$

1355 days ago

A two-tape Turing machine that accepts strings of the language L = {a^nb^nc^n | n > 0}.

Realtime comments disabled