I would have a brief question about how to construct a Turing machine that is accepting only this language:
w E L = { aibj | 0 < i < j }.
Anyone can help?
Asked
Active
Viewed 114 times
1
-
Edit: L = { a^ib^j | 0 < i < j }. – stevienailstail Jun 25 '20 at 22:44
-
You can edit your own question, just click the "edit" button below the post, next to the "share", "follow", "delete", and so on (not always available on mobile, though). – Arthur Jun 25 '20 at 23:23
-
You should use LaTeX. Also what kind of Turing machine do you need? There are many kinds (deterministic, non-deterministic, with one tape, with many tapes, etc,). – markvs Jun 25 '20 at 23:24