
LUSTRE
 Referenced in 38 articles
[sw08938]
 generate efficient sequential code, namely, a finite state automaton which represents the control...

automata
 Referenced in 14 articles
[sw07632]
 language recognized by a finite automaton; compute an automaton for the language given ... rational expression; minimalize a finite automaton...

MOPS
 Referenced in 23 articles
[sw10117]
 represents the security property as a finite state automaton, and uses model checking techniques...

DCVALID
 Referenced in 14 articles
[sw20416]
 every formula D, we construct a finite state automaton A(D) precisely accepting the finite...

LANGAGE
 Referenced in 35 articles
[sw00501]
 language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable ... Maple packages for processing automata and finite semigroups...

Antichains
 Referenced in 26 articles
[sw20208]
 algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm ... subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm ... algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show ... solving the languageinclusion problem for nondeterministic finite automata, and the emptiness problem for alternating...

fsaLib
 Referenced in 3 articles
[sw14518]
 fsaLib : finite state automaton Library. fsaLib creates deterministic or probabilistic automata from regular expressions...

FASTUS
 Referenced in 3 articles
[sw17362]
 works essentially as a cascaded, nondeterministic finitestate automaton. There are five stages...

HyDI
 Referenced in 3 articles
[sw11912]
 dynamics. They are based on a finitestate automaton structure enriched with invariant and flow...

FSA
 Referenced in 1 article
[sw21341]
 Finite State Automaton processing in Python. This package contains functions for manipulating FiniteState Automata...

LocUsT
 Referenced in 1 article
[sw20430]
 resource access patterns, represented through a finite state automaton parametrized over resources. Finally, LocUsT decides...

Decombinator
 Referenced in 1 article
[sw23150]
 then describe a novel application of finitestate automaton to map Illumina shortread sequence...

AUTOMATE
 Referenced in 12 articles
[sw00059]
 AUTOMATE, a computing package for automata and finite semigroups. AUTOMATE is a package written ... calculate the deterministic noncomplete minimal automaton of a rational language and the transition monoid...

OpenNWA
 Referenced in 3 articles
[sw33220]
 OpenNWA: A NestedWord Automaton Library. Nestedword automata (NWAs) are a language formalism that ... helps bridge the gap between finitestate automata and pushdown automata. NWAs can express some ... retain all the desirable closure characteristics of finitestate automata. This paper describes OpenNWA ... packaged with WALi—the Weighted Automaton Library—and interoperates closely with the weighted pushdown system...

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...

IDP3
 Referenced in 7 articles
[sw22941]
 system. The core of IDP3 is a finite model generator that supports firstorder logic ... classical problem of learning a minimal automaton consistent with a given set of strings...

Automata
 Referenced in 2 articles
[sw19148]
 hybrid Mathematica/C++ package that manipulates finites state machines and their syntactic semigroups. A number ... library: examples include the power automaton construction, minimization using Hopcroft’s algorithm, generation of syntactic...

libVATA
 Referenced in 1 article
[sw33005]
 libvata is a highly optimised nondeterministic finite tree automata library. The main focus ... storing the transition table of the automaton. It is intended to be used for automata ... library can also be used for finite word automata (which are, basically, unary trees...

Vcsn
 Referenced in 1 article
[sw21339]
 called transducers then — or even more generally finite automata with multiplicity, that is, automata that ... instantiated to any particular kind of automaton. As a result, we obtain efficient code from...

TravMC
 Referenced in 1 article
[sw09396]
 schemes (HORS)  is a natural generalisation of finitestate and pushdown model checking. Recent work ... problem for deterministic trivial automata: does the automaton accept every tree in the tree language...