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 14 articles )

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

  1. Almeida, Jorge; Costa, Alfredo; Kyriakoglou, Revekka; Perrin, Dominique: On the group of a rational maximal bifix code (2020)
  2. Davies, Sylvie: Primitivity, uniform minimality, and state complexity of Boolean operations (2018)
  3. Pantone, Jay: The enumeration of permutations avoiding 3124 and 4312 (2017)
  4. Costa, Alfredo; Steinberg, Benjamin: A categorical invariant of flow equivalence of shifts (2016)
  5. Klimann, Ines: Automaton semigroups: the two-state case. (2016)
  6. Nekrashevych, Volodymyr: Mating, paper folding, and an endomorphism of (\mathbbPC^2) (2016)
  7. Albert, Michael H.; Atkinson, M. D.; Vatter, Vincent: Inflations of geometric grid classes: three case studies (2014)
  8. Albert, Michael; Atkinson, Mike; Brignall, Robert: The enumeration of three pattern classes using monotone grid classes (2012)
  9. Albert, M. H.; Linton, S. A.: Growing at a perfect speed (2009)
  10. Brown, Ronald; Ghani, Neil; Heyworth, Anne; Wensley, Christopher D.: String rewriting for double coset systems. (2006)
  11. Cordeiro, Edite; Delgado, Manuel: Computing relative Abelian kernels of finite monoids. (2006)
  12. Delgado, Manuel; Morais, José: On the \textttGAPpackage sgpviz. (2006)
  13. Sakarovitch, Jacques: The language, the expression, and the (small) automaton (2006)
  14. Delgado, Manuel; Morais, José: Approximation to the smallest regular expression for a given regular language (2005)

Further publications can be found at: