Inproceedings,

A Universal Turing Machine with 3 States and 9 Symbols.

, and .
Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, page 311-318. Springer, (2001)

Meta data

Tags

Users

  • @dblp

Comments and Reviews