<p>Yes, it is a lovely observation. At first it might be a little surprising, but it is widely known, in disguise.</p>

<p>If we write the instantaneous description of a Turing machine as $vqw$, where $q$ is the state, $v,w$ are the segments left and right of the head, then the next ID of the TM is obtained by just a local transformation of the string $vqw$ (namely $q$, the letter next to $q$ that the TM is reading, and one or two neighbouring letters). This observation is used when showing that every TM accepted language can be generated by a <strong>type-0 grammar</strong>. Such a grammar can only transform a local part of the string (and thus this can be simulated by a FST/GSM). Applying consecutive derivation steps then is iterating the transducer.</p>

CC BY-SA 3.0
2012-12-27T12:23:52.620Z
2012-12-27T12:23:52.620Z
Hendrik Jan
<p>We used this idea in our paper [J. Shallit and D. Swart, An Efficient Algorithm 
for Computing the ith Letter of phi^n (a), SODA 1990, 768-777] to show that a problem about iterated finite-state transducers is EXPTIME-hard.</p>

CC BY-SA 3.0
2012-12-30T12:55:50.643Z
2012-12-30T12:55:50.643Z
Jeffrey Shallit
<p>A question partly inspired by a recent question[1] on the utility of FSMs: Years ago noticed the following property of <a href="http://en.wikipedia.org/wiki/Finite_state_transducer" rel="nofollow noreferrer">FSM transducers</a> with $\epsilon$-transitions (which allow an "empty" transition without an output symbol). Its not complicated but not trivial either; it seems to be rarely taught, and also shows a close relationship between FSMs and TMs. It also shows up as a somewhat/seemingly natural mechanism for studying the Collatz conjecture by linking to questions on automata.[2]</p>

<p>Take any TM and consider the sequence of IDs, instantaneous description strings, associated with the TM tape and current state, also called a "computational tableau". (Details of the ID format/encoding are not nec so important but one simple method is to have the current TM state located embedded in the string at the current head position.) The sequential results of the TM after each TM step, $d_1, d_2, ... d_n$ can be computed by a FSM transducer with $\epsilon$-transitions, working left-to-right. am interested in answers to any of the following questions.</p>

<blockquote>
  <ul>
  <li>What are some refs that refer to this correspondence/construction (computation of TM tableaus by FSM transducer iterations)?</li>
  <li>What is the earliest one to point it out? </li>
  <li>What are some notable results (if any) related to it?</li>
  </ul>
</blockquote>

<p>Note, FSM transducers were also called "generalized sequential machines" in early automata theory from the 1960s.</p>

<p>[1] <a href="https://cstheory.stackexchange.com/questions/14811/what-is-the-enlightenment-im-supposed-to-attain-after-studying-finite-automata">What is the enlightenment I&#39;m supposed to attain after studying finite automata?</a></p>

<p>[2] <a href="https://cstheory.stackexchange.com/questions/5675/collatz-conjecture-grammars-automata">Collatz Conjecture &amp; Grammars / Automata</a></p>

<reference-request><automata-theory><turing-machines><ho.history-overview>
iterations of a $\epsilon$-FSM transducer on a tape as equivalent to a TM computation
vzn
# iterations of a $\epsilon$-FSM transducer on a tape as equivalent to a TM computation

(Asked by: username_0 on 2012-12-24)

A question partly inspired by a recent question[1] on the utility of FSMs: Years ago noticed the following property of [FSM transducers](http://en.wikipedia.org/wiki/Finite_state_transducer) with $\epsilon$-transitions (which allow an "empty" transition without an output symbol). Its not complicated but not trivial either; it seems to be rarely taught, and also shows a close relationship between FSMs and TMs. It also shows up as a somewhat/seemingly natural mechanism for studying the Collatz conjecture by linking to questions on automata.[2]

Take any TM and consider the sequence of IDs, instantaneous description strings, associated with the TM tape and current state, also called a "computational tableau". (Details of the ID format/encoding are not nec so important but one simple method is to have the current TM state located embedded in the string at the current head position.) The sequential results of the TM after each TM step, $d\_1, d\_2, ... d\_n$ can be computed by a FSM transducer with $\epsilon$-transitions, working left-to-right. am interested in answers to any of the following questions.

> * What are some refs that refer to this correspondence/construction (computation of TM tableaus by FSM transducer iterations)?
> * What is the earliest one to point it out?
> * What are some notable results (if any) related to it?

Note, FSM transducers were also called "generalized sequential machines" in early automata theory from the 1960s.

[1] [What is the enlightenment I'm supposed to attain after studying finite automata?](https://cstheory.stackexchange.com/questions/14811/what-is-the-enlightenment-im-supposed-to-attain-after-studying-finite-automata)

[2] [Collatz Conjecture & Grammars / Automata](https://cstheory.stackexchange.com/questions/5675/collatz-conjecture-grammars-automata)

**Tags:** reference-request, automata-theory, turing-machines, ho.history-overview

---

## 2 answers

### Answer by username_2 on 2012-12-30. Score: 6 | Accepted answer

We used this idea in our paper [J. Shallit and D. Swart, An Efficient Algorithm
for Computing the ith Letter of phi^n (a), SODA 1990, 768-777] to show that a problem about iterated finite-state transducers is EXPTIME-hard.


---

### Answer by username_1 on 2012-12-27. Score: 7

Yes, it is a lovely observation. At first it might be a little surprising, but it is widely known, in disguise.

If we write the instantaneous description of a Turing machine as $vqw$, where $q$ is the state, $v,w$ are the segments left and right of the head, then the next ID of the TM is obtained by just a local transformation of the string $vqw$ (namely $q$, the letter next to $q$ that the TM is reading, and one or two neighbouring letters). This observation is used when showing that every TM accepted language can be generated by a **type-0 grammar**. Such a grammar can only transform a local part of the string (and thus this can be simulated by a FST/GSM). Applying consecutive derivation steps then is iterating the transducer.


---

