Enumerator (computer science): Difference between revisions

Revision as of 16:25, 18 February 2021

Revision as of 15:45, 16 April 2021

Line 2:

==Formal definition==

{{Unreferenced section|date=April 2021}}

An enumerator <math>E</math> is usually represented as a 2-tape [[Turing machine]]. One working tape, and one print tape. It can be defined by a 7-tuple, following the notation of a [[Turing machine]]:

<math>E = \langle Q, \Sigma, \Gamma, \delta, q_0, q_{print}, q_{reject}\rangle</math>