automata

The Automata package, as its name suggests, is package with algorithms to deal with automata. The features of this package may be found in the manual, either in the html or in the pdf format. These include: computing a rational expression for the language recognized by a finite automaton; compute an automaton for the language given by a rational expression; minimalize a finite automaton;


References in zbMATH (referenced in 12 articles )

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

  1. Pantone, Jay: The enumeration of permutations avoiding 3124 and 4312 (2017)
  2. Albert, Michael H.; Atkinson, M.D.; Vatter, Vincent: Inflations of geometric grid classes: three case studies (2014)
  3. Albert, Michael; Atkinson, Mike; Brignall, Robert: The enumeration of three pattern classes using monotone grid classes (2012)
  4. Caron, Pascal; Champarnaud, Jean-Marc; Mignot, Ludovic: Acyclic automata and small expressions using multi-tilde-bar operators (2010)
  5. Gruber, Hermann; Holzer, Markus: Provably shorter regular expressions from deterministic finite automata. (Extended abstract) (2008)
  6. Gruber, Hermann; Johannsen, Jan: Optimal lower bounds on regular expression size using communication complexity (2008)
  7. Han, Yo-Sub; Wood, Derick: Obtaining shorter regular expressions from finite-state automata (2007)
  8. Brown, Ronald; Ghani, Neil; Heyworth, Anne; Wensley, Christopher D.: String rewriting for double coset systems. (2006)
  9. Cordeiro, Edite; Delgado, Manuel: Computing relative Abelian kernels of finite monoids. (2006)
  10. Delgado, Manuel; Morais, José: On the GAP package sgpviz. (2006)
  11. Sakarovitch, Jacques: The language, the expression, and the (small) automaton (2006)
  12. Delgado, Manuel; Morais, José: Approximation to the smallest regular expression for a given regular language (2005)


Further publications can be found at: http://www.gap-system.org/Manuals/pkg/automata/doc/chap0.html