Loading...
Please wait, while we are loading the content...
Similar Documents
On the Power of Realltime Turing Machines: K Tapes Are More Powerful than K , 1 Tapes
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bruda, Stefan D. Department, Selim G. Akl |
| Copyright Year | 1999 |
| Abstract | We show that, for any integer k, there is at least one language which is accepted by a k-tape real{time Turing machine, but cannot be accepted by a (k 1)-tape real{time Turing machine. We show therefore that the languages accepted by real{time Turing machines form an in nite hierarchy with respect to the number of tapes used. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ftp.qucis.queensu.ca/TechReports/Reports/1999-429.pdf |
| Alternate Webpage(s) | http://www.cs.queensu.ca/TechReports/Reports/1999-429.pdf |
| Alternate Webpage(s) | http://research.cs.queensu.ca/TechReports/Reports/1999-429.pdf |
| Alternate Webpage(s) | http://www.qucis.queensu.ca/TechReports/Reports/1999-429.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |