• MONA

  • Referenced in 133 articles [sw06170]
  • automata, three-valued logic, eager minimization, BDD-based automata representations, and cache-conscious data structures...
  • AMoRE

  • Referenced in 12 articles [sw20980]
  • expression into finite automata, determinization and minimization of automata (including a heuristic minimization of nondeterministic...
  • Symbolic automata

  • Referenced in 5 articles [sw13262]
  • toolkit supports analysis of finite symbolic automata and transducers over strings. It also handles transducers ... solving is used when composing and minimizing automata, and a much deeper and powerful integration...
  • automata

  • Referenced in 14 articles [sw07632]
  • package with algorithms to deal with automata. The features of this package may be found ... language given by a rational expression; minimalize a finite automaton...
  • LANGAGE

  • Referenced in 39 articles [sw00501]
  • language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable ... Maple packages for processing automata and finite semigroups...
  • Finite Automata HF

  • Referenced in 6 articles [sw29250]
  • Automata in Hereditarily Finite Set Theory. Finite Automata, both deterministic and non-deterministic, for regular ... NFAs to DFAs. Left and right languages; minimal DFAs. Brzozowski’s minimization algorithm. Uniqueness...
  • AUTOMATE

  • Referenced in 12 articles [sw00059]
  • AUTOMATE, a computing package for automata and finite semigroups. AUTOMATE is a package written ... allows to calculate the deterministic non-complete minimal automaton of a rational language...
  • FAT

  • Referenced in 1 article [sw24988]
  • determinization via the powerset construction; minimization of deterministic finite automata; intersection, union, and complement...
  • JFLAP

  • Referenced in 13 articles [sw10334]
  • topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines, several types ... minimal state DFA to a regular expression or regular grammar. Click here for more information...
  • AG

  • Referenced in 4 articles [sw15652]
  • automata (union, concatenation, Kleene closure,.) as well as the usual transformations (trimming, minimization...
  • CALF

  • Referenced in 2 articles [sw25000]
  • minimization. We illustrate its generality with two examples: deterministic and weighted automata...
  • BALM-II

  • Referenced in 2 articles [sw38885]
  • most typical automata operations, such as determinization and state minimization, as well as some visualization...
  • FSA

  • Referenced in 1 article [sw21341]
  • manipulating Finite-State Automata (FSAs). It includes functions for minimizing and determinizing FSAs, computing...
  • Stamina

  • Referenced in 2 articles [sw24797]
  • automata theory. First, compute the star height of a regular language, i.e. the minimal number ... optimisations and heuristics, allow us to handle automata with several hundreds of states. This radically...
  • LinAIG

  • Referenced in 6 articles [sw10316]
  • algorithm for the verification of linear hybrid automata with large discrete state spaces (where ... space traversal are redundancy elimination and constraint minimization: redundancy elimination eliminates so-called redundant linear...
  • STANSE

  • Referenced in 2 articles [sw26812]
  • with new bug-finding techniques with a minimal effort. Currently there are four bug-finding ... STANSE: AutomatonChecker checks properties described in an automata-based formalism, ThreadChecker detects deadlocks among multiple...
  • Automata

  • Referenced in 2 articles [sw19148]
  • number of operations on one-dimensional cellular automata are also available. All the algorithms ... library: examples include the power automaton construction, minimization using Hopcroft’s algorithm, generation of syntactic...
  • LANGAGEA

  • Referenced in 1 article [sw15338]
  • language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable ... Maple packages for processing automata and finite semigroups...
  • CGAL

  • Referenced in 384 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...