dk.brics.automaton project is a Java package that contains a DFA/NFA (finite-state automata) implementation with Unicode alphabet (UTF16) and support for the standard regular expression operations (concatenation, union, Kleene star).
In contrast to many other automaton/regexp packages, this package is fast, compact, and implements real, unrestricted regular operations. It uses a symbolic representation based on intervals of Unicode characters.
What is new in this release:
- added Automaton.makeStringUnion (Daciuk et al.'s algorithm for constructing a minimal automaton that accepts a union of strings) - contributed by D. Weiss
- added call to clearHashCode in Automaton.reduce - thanks to D. Weiss
- minimization is now optional in RegExp.toAutomaton - suggested by H. Zauner
- SpecialOperations.reverse made public - suggested by Daniel Lowe
What is new in version 1.11-1:
- AutomatonMatcher was added for matching substrings.
- A bug in SpecialOperations.overlap was fixed.
Requirements:
- Java 2 Standard Edition Runtime Environment
Comments not found