AMoRE

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

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 12 articles )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Castiglione, G.; Restivo, A.; Sciortino, M.: On extremal cases of Hopcroft’s algorithm (2010)
  2. Castiglione, Giusi; Restivo, Antonio; Sciortino, Marinella: On extremal cases of Hopcroft’s algorithm (2009)
  3. Castiglione, G.; Restivo, A.; Sciortino, M.: Circular Sturmian words and Hopcroft’s algorithm (2009)
  4. Delgado, Manuel: Commutative images of rational languages and the Abelian kernel of a monoid (2001)
  5. Duchamp, G.; Flouret, M.; Laugerotte, E.; Luque, J.-G.: Direct and dual laws for automata with multiplicities (2001)
  6. Knuutila, T.: Re-describing an algorithm by Hopcroft (2001)
  7. Steinberg, Benjamin: Finite state automata: a geometric approach (2001)
  8. Caron, Pascal; Ziadi, Djelloul: Characterization of Glushkov automata (2000)
  9. Ponty, J.-L.: An efficient null-free procedure for deciding regular language membership (2000)
  10. Champarnaud, J.-M.; Ponty, J.-L.; Ziadi, D.: From regular expressions to finite automata (1999)
  11. Delgado, Manuel: Type II theorem and hyperdecidability of pseudovarieties of groups (1998)
  12. Egner, Sebastian; Püschel, Markus: Solving puzzles related to permutation groups (1998)