Abstract

A previous paper described the implementation of the decision procedure for the weak second-order theory of one successor (WSlS), especially those parts critical to its overall performance. This paper explores further some of the topics described in that paper, including minimization, representation of automata, subset construction, and other aspects of the decision procedure. New data will be presented to illustrate how various approaches to the above procedure affect the algorithm's performance.KeywordsTransition FunctionInternal NodeDecision ProcedureFinite AutomatonBinary Search TreeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.