Turing Machine Help

[BlackOmen]

I need to design a turing machine to accept the language made up of ww, where w are strings made up of a's and b's.

I'm not asking anyone to solve this for me, I just need a little bit of help getting started because I have nothing so far.

Thanks in advance.

 

[KingNothing]

What's a turing machine? Are you writing a program or making a physical machine?

 

[BlackOmen]

It's a mathematical abstraction of a machine. It has applications to computational and automata theory. You'll see it in a college language theory class (which is where I'm seeing it )

 

[littleprince]

what school and course is this for?

 

[Electric Amish]

I wish you would have caught me a couple of semesters ago...

amish

 

[BlackOmen]

<< what school and course is this for? >>
Millersville University of PA; CSCI 240-Computational Models

<< I wish you would have caught me a couple of semesters ago... >>
grrrrr

 

[Ameesh]

can you give me a regular expression of the language its supposed to accept?

 

[BlackOmen]

(a+b)*(a+b)* where each instance of (a+b)* is the same as the other. I guess that's the best I can express it. It's also been long enough since we've talked about regular expressions and finite state automata.

Such as w=abba and ww=abbaabba
or w=abababa and ww=abababaabababa

 

[DAWeinG]

lol I just learned this topic 3 weeks ago, and then spring break hit and most of it's lost This is also discrete math for introductory computer science students.

Are you trying to design the machine like (initial state, input, next state, output, where to move) ? Sort of a set of instructions for five items? And then to determine whether the string is accepted or not?

lol oh well I tried

 

[Ameesh]

<< (a+b)*(a+b)* where each instance of (a+b)* is the same as the other. I guess that's the best I can express it. It's also been long enough since we've talked about regular expressions and finite state automata.

Such as w=abba and ww=abbaabba
or w=abababa and ww=abababaabababa >>



thats an interesting one, let me think about it for a bit.