1
I Use This!
Inactive
Analyzed about 12 hours ago. based on code collected about 12 hours 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

Place Warranty

Commercial Use

Modify

Distribute

Forbidden

Sub-License

Hold Liable

Required

Distribute Original

Disclose Source

Include Copyright

State Changes

Include License

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
  • ...
    compare projects before you chose one to use
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    check out hot projects on the Open Hub

Languages

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

30 Day Summary

Apr 24 2018 — May 24 2018

12 Month Summary

May 24 2017 — May 24 2018

Ratings

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