Home » net.automatalib » automata-incremental » 0.3.1-ase2013-tutorial

AutomataLib :: Incremental » 0.3.1-ase2013-tutorial

This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

LicenseLGPL 3.0
Tagsautomataincremental
DateNov 06, 2013
Filespom (2 KB)  jar (38 KB)  View All
RepositoriesCentralAxiomAlaskaEndeavourHealthGeomajasMulesoft
Ranking#91182 in MvnRepository (See Top Artifacts)
Used By5 artifacts

Note: There is a new version for this artifact

New Version0.12.1

Scope:
Scope:
Format:
Scope:
Scope:
Scope:
Scope:
Scope:
Scope:

Compile Dependencies (4)

Category/License Group / ArtifactVersionUpdates

Apache 2.0		net.automatalib » automata-commons-util 0.3.1-ase2013-tutorial0.12.1
Collections
Apache 2.0		net.automatalib » automata-commons-smartcollections 0.3.1-ase2013-tutorial0.12.1

Apache 2.0		net.automatalib » automata-api 0.3.1-ase2013-tutorial0.12.1

Apache 2.0		net.automatalib » automata-core 0.3.1-ase2013-tutorial0.12.1

Test Dependencies (2)

Category/License Group / ArtifactVersionUpdates

Apache 2.0		net.automatalib » automata-util 0.3.1-ase2013-tutorial0.12.1
Testing
Apache 2.0		org.testng » testng 6.87.11.0

Licenses

LicenseURL
GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 http://www.gnu.org/licenses/lgpl-3.0-standalone.html

Developers

NameEmailDev IdRolesOrganization
Malte Isbernermalte.isberner<at>gmail.commisbernerDeveloperTU Dortmund, Chair for Programming Systems