A turing machine is just a finite automation with 2 stacks: 'A comment on teaching theory of computation' by Kreinovich Vladik & Kosheleva Olga

https://www.cs.utep.edu/vladik/2018/tr18-54.pdf nostr:note1qnd7ceka3yjcjafd06e3xyzka8xsg0umsygkjruuqjqha0a9h0wsaq0k32

Reply to this note

Please Login to reply.

Discussion

No replies yet.