Talk:Queue automaton

I started this page, as per request. Will finish it soon. SamuelRiv 13:34, 6 November 2007 (UTC) [reply ]

Be wary with this page, as it is a common homework exercise for into computer science students. Therefore, I am not sure if I want to give a proof of Turing-completeness here (also I don't want to have to type it all out). Thoughts? SamuelRiv 13:34, 6 November 2007 (UTC) [reply ]

I could use help from somebody better at LaTeX than I: The transition arrows should look like (using notation from Kozen)

${\displaystyle {\begin{array}{c}1\\\rightarrow \\M\end{array}}~and~{\begin{array}{c}*\\\rightarrow \\M\end{array}}}${\displaystyle {\begin{array}{c}1\\\rightarrow \\M\end{array}}~and~{\begin{array}{c}*\\\rightarrow \\M\end{array}}}

Can somebody help to typeset this in a more elegant way? It should be just an arrow with a small "1" or "*" above and a small "M" below, and I'd like it to be able to format in-line. SamuelRiv 13:34, 6 November 2007 (UTC) [reply ]

• Stub-Class Computing articles
• Unknown-importance Computing articles
• Automatically assessed Computing articles
• All Computing articles