AMoRE

AMoRE is an implementation of automata theory algorithms, including

• conversion of regular expression into finite automata,
• determinization and minimization of automata (including a heuristic minimization of nondeterministic automata),
• language operations (e.g. boolean and regular operations, quotients, shuffle product),
• tests of properties (e.g. for set inclusion, nonemptiness),
• computation of the syntactic monoid and its algebraic decomposition

The AMoRE C-library is available here. The Java bindings and graphical user interface will follow soon.

It runs on GNU systems (like Linux) is aimed at both uses who want a nice graphical user interface and programmers who want to use the algorithms from Java or C programs.

The language bindings are stable and more or less complete, but the GUI is buggy. This has delayed release somewhat. The "pre" release is stable, only some things (like tests and algebraic decompositon) are missing in the GUI.

Most of the development of AMoRE was done at Lehrstuhl für Informatik VII, Logik und Theorie diskreter Systeme and before, at the University of Kiel. The older, terminal-based version (ncurses) of AMoRE (version 3) can still be found here

• sourceforge project page

Publication (a bit outdated w.r.t. new version, but valuable):
O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, Report on the Program AMoRE ,Report 9507, Inst. für Informatik u. Prakt. Mathematik, CAU Kiel, 1995.

Contact:

Burak Emir, [mailto]