1
I Use This!
Inactive
Analyzed 5 days ago. based on code collected 5 days ago.

Project Summary

Learn Finite State Automata that generalize over a set of training instances.

This is an (incomplete) implementation of GAL, the Genetic Automaton Learner as
defined in Chapter 5 of Belz (2000).

The point of this code is to learn a FSA that *generalizes* from a set of positive
examples. (If you just want to cover exactly the input, you can use any existing
package for doing FSA minimization.)

The input file is in text format, one sequence per line, the alphabet will be induced
by tokens separated by white-spaces.

Tags

finitestateautomata finitestatemachine fsm geneticalgorithms java learner

In a Nutshell, Genetic Automaton Learner (GAL)...

Quick Reference

GNU General Public License v2.0 or later
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Forbidden

Sub-License

Hold Liable

Required

Include Copyright

Include License

Distribute Original

Disclose Source

State Changes

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    anyone with an Open Hub account can update a project's tags
  • ...
    use of OSS increased in 65% of companies in 2016
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog

Languages

Languages?height=75&width=75
Java
99%
XML
1%

30 Day Summary

Sep 19 2018 — Oct 19 2018

12 Month Summary

Oct 19 2017 — Oct 19 2018

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!