非确定性有限自动机
[英]Non-deterministic finite automata
问题描述
Could someone explain why this(the automata in the picture)is a NDFA?
有人可以解释为什么这（图中的自动机）是 NDFA？ Is it because it only has one initial state or because there are several arrows with the same symbol that arrive at the same state?是因为它只有一个初始状态，还是因为有多个具有相同符号的箭头到达相同状态？ I dont quite understand if one of those things define it as an NDFA?我不太明白其中一项是否将其定义为 NDFA？
1 个解决方案
解决方案1
3 已采纳 2020-03-25 04:51:51
It's non-deterministic because q1 has two different transitions on # .这是不确定的，因为q1在#上有两个不同的转换。
After (# , the machine is in states q1 and q3 , and will accept all of @) , #@) , ##@) , etc.在(# ，机器处于状态q1和q3 ，将接受所有@) ， #@) ， ##@)等。
State q3 is, however, redundant.然而，状态q3是多余的。 You could just remove it to produce a DFA that accepts the same language.您可以将其删除以生成接受相同语言的 DFA。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.