An Inefficient Representation of the Empty Word

P.R.J. Asveld

    Research output: Book/ReportReportProfessional

    33 Downloads (Pure)


    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.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherUniversity of Twente
    Number of pages6
    Publication statusPublished - 1996

    Publication series

    NameMemoranda informatica
    PublisherUniversity of Twente
    ISSN (Print)0924-3755


    • HMI-SLT: Speech and Language Technology


    Dive into the research topics of 'An Inefficient Representation of the Empty Word'. Together they form a unique fingerprint.

    Cite this