statechum
- A relatively brief manual can be found in resources/introduction/index.html # description statechum is a framework that implements a number of regular grammar inference algorithms. Regular grammars can be represented as finite state machines. Once the grammar / state machine has been generated, statechum can visualise it, and provides a selection of state-machine analysis and testing algorithms.