Automata

A library that implements formal finite state automata.

License	The MIT License (MIT)
Categories	Auto Application Layer Libs Code Generators
GroupId	tel.schich
ArtifactId	automata
Last Version	0.2.1
Release Date	Apr 22, 2019
Type	jar
Description	Automata A library that implements formal finite state automata.
Project URL	https://schich.tel
Source Code Management	https://github.com/pschichtel/automata

Download automata

Filename	Size
automata-0.2.1.pom
automata-0.2.1.jar	53 KB
automata-0.2.1-sources.jar	46 KB
automata-0.2.1-javadoc.jar	206 KB

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/tel.schich/automata/ -->
<dependency>
    <groupId>tel.schich</groupId>
    <artifactId>automata</artifactId>
    <version>0.2.1</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/tel.schich/automata/
implementation 'tel.schich:automata:0.2.1'

Gradle Kotlin

// https://jarcasting.com/artifacts/tel.schich/automata/
implementation ("tel.schich:automata:0.2.1")

Apache Buildr

'tel.schich:automata:jar:0.2.1'

Apache Ivy

<dependency org="tel.schich" name="automata" rev="0.2.1">
  <artifact name="automata" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='tel.schich', module='automata', version='0.2.1')
)

Scala SBT

libraryDependencies += "tel.schich" % "automata" % "0.2.1"

Leiningen

[tel.schich/automata "0.2.1"]

Dependencies

test (1)

Group / Artifact	Type	Version
junit : junit	jar	4.12

Project Modules

There are no modules declared in this project.

Automata

A library that implements formal finite state automata.

If you are looking for an efficient and feature complete linear-time regular expression engine, then this is not the project for you. Google's re2 will very likely do a better job at that.

However if you are trying to convert regular expressions into FSAs in order to proof certain properties of the regular expressions and are not too tight on performance requirements, this could be the project you are looking for.

What works?

• Converting simple ("formal") regular expressions into NFAs
• Converting Java's Patterns (most of the regular syntax is supported) into NFAs
• Converting NFAs into DFAs
• Various operations on DFAs and/or NFAs:
  • minimizing DFAs
  • completing DFAs
  • combining multiple automata into a one (e.g. intersection)
  • complements
• simple text matching

Possible future features

• Transition events
• ???

Inspired by

Prof. Dr. Karl Stroetmann's Formal Languages Lecture

Versions

Version
0.2.1 Apr 22, 2019
0.2.0 Apr 7, 2019
0.1.0 Apr 5, 2019