From 3ceb910fa3cebca833994b93c976df71afcf43a4 Mon Sep 17 00:00:00 2001 From: Maarten Date: Sun, 30 Oct 2016 23:18:14 +0100 Subject: [PATCH] Add pom,update readme --- .gitignore | 3 +- README.md | 18 +++++++ pom.xml | 147 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 167 insertions(+), 1 deletion(-) create mode 100644 pom.xml diff --git a/.gitignore b/.gitignore index a8b8ecf..1ce9d43 100644 --- a/.gitignore +++ b/.gitignore @@ -18,4 +18,5 @@ hs_err_pid* gradle/ gradlew *.gradle -gradlew.* \ No newline at end of file +gradlew.* +target/ \ No newline at end of file diff --git a/README.md b/README.md index 261c094..fa55e93 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,24 @@ # Nondeterministic finite state automata This is a library that provides an implemention [nondeterminstic finite state automata](https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton) (NFAs) in Java. You can think of NFAs as flowcharts: you are in a state, take some action, and arrive in a new state. The action can produce a side effect, such as writing a string to a tape. +## Usage +Download [the latest JAR](https://github.com/digitalheir/nfa/releases/latest) or grab from Maven: + +```xml + + + org.leibnizcenter + nfa + 1.0.0 + + +``` + +or Gradle: +```groovy +compile 'org.leibnizcenter:nfa:0.9.6' +``` + ## Why? There are already a bunch of libraries out there which work with deterministic finite state automata (DFAs), and there is a well-known result in automata theory which says that for any language recognized by an NFA, we can construct a DFA which recognizes the same language. diff --git a/pom.xml b/pom.xml new file mode 100644 index 0000000..1b50c51 --- /dev/null +++ b/pom.xml @@ -0,0 +1,147 @@ + + + 4.0.0 + + org.leibnizcenter + nfa + 1.0.0 + jar + + + + MIT License + http://www.opensource.org/licenses/mit-license.php + + + + + + Maarten Trompper + maarten.trompper@gmail.com + Leibniz Center for Law + http://www.leibnizcenter.org/ + + + + ${project.groupId}:${project.artifactId} + Streaming non-deterministic finite automata + https://github.com/digitalheir/java-nfa + + + scm:git:git@github.com:digitalheir/java-nfa + scm:git:git@github.com:digitalheir/java-nfa.git + git@github.com:digitalheir/java-nfa.git + + + + + junit + junit + 4.12 + test + + + com.google.guava + guava + 20.0 + + + + com.github.krukow + clj-ds + 0.0.4 + + + org.jetbrains + annotations + RELEASE + + + + + ossrh + https://oss.sonatype.org/content/repositories/snapshots + + + ossrh + https://oss.sonatype.org/service/local/staging/deploy/maven2/ + + + + + + org.apache.maven.plugins + maven-compiler-plugin + + 1.8 + 1.8 + + 3.3 + + + org.apache.maven.plugins + maven-source-plugin + 2.4 + + + + + + attach-sources + + jar + + + + + + org.apache.maven.plugins + maven-javadoc-plugin + 2.10.3 + + + attach-javadocs + + jar + + + + + -Xdoclint:none + + + + org.sonatype.plugins + nexus-staging-maven-plugin + 1.6.7 + true + + ossrh + https://oss.sonatype.org/ + true + + + + org.apache.maven.plugins + maven-gpg-plugin + 1.6 + + + sign-artifacts + verify + + sign + + + + + + + + + UTF-8 + UTF-8 + +