是否有一个术语来表示保证停止的有限状态机？
我之前正在讨论状态机，有一个问题是它是否可能不会因某些输入而停止。这似乎是状态机的一个重要且经常被提及的属性，但我一生都无法弄清楚该属性的名称是什么。有这样的术语吗？它是“可停止的”、“不是无限循环的”还是其他什么？
I was having a discussion earlier about a state machine, and there was a question as to whether it might not halt on some input. It seems like a property of state machines that is important and frequently mentioned, but I can't for the life of me figure out what the name of that property is. Is there such a term? Is it "haltable", "not-infinitely-loopy", or something else?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
总是停止的机器称为决策者。
决策者只需是一台在所有输入上都会停止的机器。例如，所有 DFA 都是决策者，DPDA 也是如此。
A machine that always halts is called a decider.
A decider need only be a machine that halts on all inputs. For example, all DFAs are deciders, as are DPDAs.
我的猜测是“停止”，源自著名的“停止问题”，这与对于你的问题，即它是否会在给定的输入上停止。一个重要的考虑因素是，机器通常不被定义为“停止”，而是针对特定输入。一般情况被证明是无法解决的（图灵本人）。
My guess would be "halting", derived from the famous "halting problem", which is similar to your question, namely whether it will halt on a given input. An important consideration is that a machine is not defined as "halting" in general, but rather for a specific input. The general case is proven to be unsolvable (by Turing himself).