Language acceptance for Non-deterministic Finite State Automata (NFAs)
Can an NFA be described using a transition table?
Can empty transitions be removed from NFAs?
Is non-determinism same as the existential quantifier?