My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum

LinkBack Thread Tools Display Modes
November 2nd, 2011, 08:50 AM   #1
Joined: Nov 2011

Posts: 3
Thanks: 0

Turing machine 2

Q1) {0^n^2|n>=1}the language consisting of all strings of 0s whose length is a square number. Give Implementation-level description.
Q2)Give give formal description of the TM and draw state diagram. {a^i ,b^j,c^k| i + j = k, and i,j>=0,k>=1}.
Some example words of the language are as follows:
a. aabccc
b. abbbbccccc
c. ac
d. bc
jenifer is offline  

  My Math Forum > College Math Forum > Applied Math

machine, turing

Search tags for this page
Click on a term to search for related topics.
Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Turing Machine krausebj0 Number Theory 1 June 28th, 2013 05:01 AM
Turing machine jenifer Applied Math 1 December 28th, 2011 12:08 PM
Turing Machine Problem... Help please ikurwa Applied Math 0 April 16th, 2011 11:37 PM
Help On Turing Machine Problems Please Christi123 Applied Math 1 April 14th, 2008 05:33 AM
A Turing Machine Question Christi123 Applied Math 0 March 22nd, 2008 04:25 PM

Copyright © 2019 My Math Forum. All rights reserved.