Simple path in a Finite Acceptor
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.