9to5
Science
Topics
Calculators
Search
About
Home
Computer Science
Formal languages
Tag
Formal languages
Can an NFA Reach Two Final States at the Same Time?
An NFA can have multiple accepting states reachable after the same input. Acceptance requires at least one successful path, not a unique final state.