Turing Machine support

Question

I have a language:

(XF*X|F)*

over the alphabet:

{X,F}

How can I get/design a Turing machine to recognize that language? Any guidance or advice would be much appreciated

@Rhymoid: This doesn't look like a graduate-level research question at all. — Jörg W Mittag, Jul 25 '14 at 12:14

score 1 · Accepted Answer · answered Jul 25 '14 at 10:38

1

That's trivial:

digraph _ {
    _ [ shape=none, label="" ]
    1 [ shape=doublecircle ]
    2 [ shape=circle ]
    _ -> 1
    1 -> 1 [ label="F" ]
    1 -> 2 [ label="X" ]
    2 -> 2 [ label="F" ]
    2 -> 1 [ label="X" ]
}

answered Jul 25 '14 at 10:38

Kijewski

25,517
12
101
143

That's a DFA, not a TM. A TM also has annotations for tape direction. – Jul 25 '14 at 10:40
@Rhymoid, yeah, also it always writes a character while it moves (possibly the same it just read). But I guess OP will manage to add arrows to the graph … – Kijewski Jul 25 '14 at 10:42
I'm struggling a little to add in the labels. Is there a good starting point or something that would help me. – user3706271 Jul 30 '14 at 10:07
The conventions differ. I know the convention "read, write, direction". E.g. the labels would read "F,F,->" or "X,X,->". – Kijewski Jul 30 '14 at 17:54

Turing Machine support

1 Answers1