Simple path in a Finite Acceptor What is the definition of a 'simple path' in a finite acceptor?
My concern is whether self loops can be considered as a part of simple path from initial to final state?
The only reasonable definition for a simple path in a finite acceptor would be a finite path in its transition graph, i.e. no vertices (states) may appear twice in that path. This especially excludes paths that use self loops.