BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
minim (3)
infinit (2)
learn (2)
word (2)
partial (2)

Stem dfas$ (all stems)

8 papers:

CIAACIAA-J-2013-BalkanskiBKW15 #complexity #on the #word
On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
CIAACIAA-2013-BalkanskiBKW #word
Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
CIAACIAA-2012-JiraskovaM #complexity #on the
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
CIAACIAA-2006-RoyC #finite #infinity #model checking
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (SR, BC), pp. 277–278.
CIAACIAA-2005-GarciaRCA #learning #question
Is Learning RFSAs Better Than Learning DFAs? (PG, JR, AC, GIA), pp. 343–344.
SEFMSEFM-2004-Roy #finite #infinity #using #verification
Symbolic Verification of Infinite Systems using a Finite Union of DFAs (SR), pp. 56–66.
CIAACIAA-2000-Watson #algorithm
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski (BWW), pp. 311–317.
CIAAWIA-1998-Watson #algorithm #performance
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.