Skip to search formSkip to main contentSkip to account menu

DFA minimization

Known as: Automaton minimization, Minimal automaton, Minimizing deterministic finite automaton 
In automata theory (a branch of computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field The… 
Highly Cited
2000
Highly Cited
2000
This paper describes a novel tool called Nimrod/O that allows a user to run an arbitrary computational model as the core of a non… 
1985
1985
Mobility measurements were made for dry-ground mica particles dispersed in aqueous KCl, Cr(NO3)3, and cetyltrimethylammonium… 
1970
1970
Of the 400 known species of Passiflora, about 50 or 60 bear edible fruits. Probably all of these are indigenous to the American… 
1966
1966
In nonionizing solvents, secondary and tertiary alkyl halides react with sodium borohydride only slowly, in many cases yielding… 
1961
1961
ZusammenfassungMit dieser kurzen Übersicht sollte der Beweis erbracht werden, daß die Kolbenmethode, d. h. die Verbrennung… 
Highly Cited
1960
Highly Cited
1960
Alles, G. A. (1939). Amer. J. Physiol. 126, 420P. Blaschko, H. (1958). In 5-Hydroxytryptamine, pp. 50-57. Ed. by Lewis, G. P… 
Highly Cited
1959
Highly Cited
1959
s 60, 5747 (1956). (100) FRANKEL, S., AND ALLERS, R.: Biochem. Z. 18,40 (1909). (101) FRIEDENWALD, J. S., MICHEL, H., AND BUSCHKE… 
Highly Cited
1959
Highly Cited
1959
SummaryA recently designed interference-filte monochromator system for biological purposes is described (spectral range: 400–800…