Short Note on Variants of a Turing Machine

Welcome back.

and 4 others joined a min ago.

10kviews

written 7.9 years ago by

pratikj2208 • 150

modified 5.7 years ago by

prashantsaini • 0

automata theory

ADD COMMENT EDIT

1 Answer

120views

written 7.9 years ago by

pratikj2208 • 150

modified 7.9 years ago by

awari.swati831 • 100

Multi-Tape Turing Machine

Formal Definitionε

A k-tape Turing Machine is M = $(Q, Σ, Γ, δ, q0, q_{acc}, q_{rej})$ where

Q is a finite set of control states

Σ is a finite set of input symbols

F ϽΣ is a finite set of tape symbols. Also, a blank symbol ϵΓ\ …

and 2 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company