A Generalised Nondeterministic Finite Automata (GNFA) is a 5-tuple
Key part of a GNFA is that
Feb 18, 20251 min read
A Generalised Nondeterministic Finite Automata (GNFA) is a 5-tuple (Q,Σ,δ,q,f)
Key part of a GNFA is that δ:(Q∖{q})×(Q∖f)→RegularExpressions