Introduction E9F5FC

Questions FFFFC0

• View
• Edit
• History
• Print

Multiplying Clifford algebra generators

{$-1=e_1^2=e_2^2=e_3^2...$}

{$e_1e_2=-e_2e_1$}

{$(e_1e_2)^2=e_1e_2e_1e_2=-e_1e_1e_2e_2=-1$}

{$(e_1e_2e_3)^2=e_1e_2e_3e_1e_2e_3=e_1e_1e_2e_3e_2e_3=-e_1e_1=+1$}

Chomsky hierarchy of automata

Finite automata: {$re=er$} implies {$e\rightarrow er$}

Pushdown automata: {$ce=e\bar{c}$} implies {$e\rightarrow cec$}

Linear bounded Turing machine: {$hex=exh$} implies {$hhhhhhex\rightarrow exhhhhhh$}

Unbounded Turing machine: {$e\rightarrow$}