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.

  • That means if there is no simple path from initial state to final state then language accepted will be empty. Right? – Lavlesh Mishra Jun 24 at 17:40
  • Yes, the language is empty if every finite state in unreachable from the initial state, in this case there is especially no simple path. – PHPNick Jun 24 at 17:59

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.