A Simple Discrete System with Chaotic Behavior

Peter R.J. Asveld

A Simple Discrete System with Chaotic Behavior

Peter R.J. Asveld

Research output: Book/Report › Report › Other research output

32 Downloads (Pure)

Abstract

We discuss the behavior of a particular discrete system, viz. Post's system of tag with alphabet $\{0,1\}$, deletion number $d=3$, and rules: $0\rightarrow 00$, $1\rightarrow 1101$. As initial strings we consider all strings of length less than or equal to 15 as well as all ``worst case'' inputs of the form $(100)^m$ with $1\leq m \leq 128$.

Original language	English
Place of Publication	Enschede
Publisher	University of Twente
Number of pages	6
Publication status	Published - 1988

Publication series

Name	Memoranda Informatica
Publisher	University of Twente, Department of Computer Science
No.	INF-88-51
ISSN (Print)	0924-3755

Keywords

HMI-SLT: Speech and Language Technology

Access to Document

Asveld1988simpleFinal published version, 25.9 KB

Cite this

@book{c6aaaac961504b6fb9dec4a9595b6bdd,

title = "A Simple Discrete System with Chaotic Behavior",

abstract = "We discuss the behavior of a particular discrete system, viz. Post's system of tag with alphabet \$\textbackslash{}\{0,1\textbackslash{}\}\$, deletion number \$d=3\$, and rules: \$0\textbackslash{}rightarrow 00\$, \$1\textbackslash{}rightarrow 1101\$. As initial strings we consider all strings of length less than or equal to 15 as well as all ``worst case'' inputs of the form \$(100)\textasciicircum{}m\$ with \$1\textbackslash{}leq m \textbackslash{}leq 128\$.",

keywords = "HMI-SLT: Speech and Language Technology",

author = "Asveld, \{Peter R.J.\}",

year = "1988",

language = "English",

series = "Memoranda Informatica",

publisher = "University of Twente",

number = "INF-88-51",

address = "Netherlands",

}

TY - BOOK

T1 - A Simple Discrete System with Chaotic Behavior

AU - Asveld, Peter R.J.

PY - 1988

Y1 - 1988

N2 - We discuss the behavior of a particular discrete system, viz. Post's system of tag with alphabet $\{0,1\}$, deletion number $d=3$, and rules: $0\rightarrow 00$, $1\rightarrow 1101$. As initial strings we consider all strings of length less than or equal to 15 as well as all ``worst case'' inputs of the form $(100)^m$ with $1\leq m \leq 128$.

AB - We discuss the behavior of a particular discrete system, viz. Post's system of tag with alphabet $\{0,1\}$, deletion number $d=3$, and rules: $0\rightarrow 00$, $1\rightarrow 1101$. As initial strings we consider all strings of length less than or equal to 15 as well as all ``worst case'' inputs of the form $(100)^m$ with $1\leq m \leq 128$.

KW - HMI-SLT: Speech and Language Technology

M3 - Report

T3 - Memoranda Informatica

BT - A Simple Discrete System with Chaotic Behavior

PB - University of Twente

CY - Enschede

ER -

A Simple Discrete System with Chaotic Behavior

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this