[comp.theory] wanted: simple TM for non-CF language

jagversm@cs.ruu.nl (Koen Versmissen) (05/30/91)

I'm looking for a Turing machine of the standard kind (i.e. just one tape; a tape which is infinite on both sides is OK) which recognizes a non context-free
language. The simpler this TM is (i.e. the smaller the number of states), the
better. 
Thanks!  Koen.

-- 
Koen Versmissen, Rijksuniversiteit Utrecht, Nederland.
(jagversm@praxis.cs.ruu.nl).

The pain of war can not exceed, the woe of aftermath - Led Zeppelin