AMoRE a program for computing with Automata, Monoids, and Regular Expressions. 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