automata - Can a deterministic finite acceptor begin at the end of string and move toward the start?

Question

If so, how is this drawn as a graph? what would you label your start state? and would you draw the graph as moving from right to left as well?

Answer 1

由于您正在处理确定性有限自动机，因此答案是否定的。

主要问题是您可能有两个转换 (p, a, r) 和 (q, a, r) 导致相同的状态 r，但 p 与 q 不同。那么，如果你从 r 开始，然后试着倒着读字母 a，你应该以 p 结尾还是 q 结尾？