Language acceptance for Non-deterministic Finite State Automata (NFAs)
How many transition functions does a NFA have?
Can an NFA be converted to a DFA?
Can an NFA be constructed such that the final symbol in input has occured before?
Can an NFA be constructed such that the final symbol in input has never occured?