• UMDES

  • Referenced in 364 articles [sw09523]
  • discrete event systems modeled by finite-state automata (FSA). There are routines for the manipulation...
  • Antichains

  • Referenced in 30 articles [sw20208]
  • algorithm for checking universality of finite automata. We propose and evaluate a new algorithm ... checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses ... language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata...
  • Timbuk

  • Referenced in 47 articles [sw06351]
  • Tree Automata (bottom-up non-deterministic finite tree automata) Timbuk and reachability analysis...
  • LANGAGE

  • Referenced in 38 articles [sw00501]
  • Maple packages for processing automata and finite semigroups...
  • Supremica

  • Referenced in 15 articles [sw18546]
  • basic model in Supremica is finite automata where the transitions have an associated event together...
  • LASH

  • Referenced in 22 articles [sw21269]
  • Liège Automata-based Symbolic Handler (LASH): LASH is a toolset for representing infinite sets ... finite-state representations, which rely on finite-state automata for representing and manipulating infinite sets...
  • AMoRE

  • Referenced in 12 articles [sw20980]
  • including: conversion of regular expression into finite automata, determinization and minimization of automata (including...
  • AutomGrp

  • Referenced in 12 articles [sw07727]
  • with groups and semigroups generated by finite automata or given by wreath recursion, as well...
  • REGAL

  • Referenced in 18 articles [sw00791]
  • random and exhaustive generation of finite deterministic automata. The random generation of automata...
  • JFLAP

  • Referenced in 12 articles [sw10334]
  • with formal languages topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines...
  • Myhill-Nerode

  • Referenced in 11 articles [sw28547]
  • languages. Many of them focus on finite automata for proving properties. Unfortunately, automata...
  • Finite Automata HF

  • Referenced in 6 articles [sw29250]
  • Finite Automata in Hereditarily Finite Set Theory. Finite Automata, both deterministic and non-deterministic...
  • TREX

  • Referenced in 46 articles [sw01388]
  • parametric (continuous-time) timed automata, extended with integer counters and finite-domain variables, and communicating...
  • RFSA

  • Referenced in 15 articles [sw03315]
  • notion of residual languages: residual finite state automata (RFSA). RFSA representations of regular languages...
  • libalf

  • Referenced in 10 articles [sw09880]
  • libalf: The Automata Learning Framework. This paper presents libalf, a comprehensive, open-source library ... various well-known learning techniques for finite automata (e.g. Angluin’s L*, Biermann, RPNI...
  • libFAUDES

  • Referenced in 10 articles [sw16433]
  • implements data structures and algorithms for finite automata and regular languages. The library takes...
  • Esterel

  • Referenced in 163 articles [sw20012]
  • compiler which translates Esterel programs into finite-state machines. It is one of a family ... systems, including real-time systems and control automata. The Esterel v5 compiler can be used...
  • AUTOMATE

  • Referenced in 12 articles [sw00059]
  • AUTOMATE, a computing package for automata and finite semigroups. AUTOMATE is a package written...
  • AUTOMATA

  • Referenced in 9 articles [sw30137]
  • Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic...
  • WFSC

  • Referenced in 6 articles [sw02802]
  • creating, manipulating, and applying weighted finite state automata. It inherits some powerful features from Xerox ... work in the field of finite state automata over two decades. The design is generic...