An Inefficient Representation of the Empty Word

Share/Save/Bookmark

Asveld, Peter R.J. (1996) An Inefficient Representation of the Empty Word. [Report]

[img]
Preview
PDF
70Kb
Abstract:We show that Post's system of tag with alphabet $\{0,1\}$, deletion number 3, productions $0\rightarrow 00$ and $1\rightarrow 1101$, and initial string $111\cdots 1$ (330 times) converges to the empty word after a very large number of rewriting steps.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64299
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 121725