S.A.F.E.

Given an automaton M that starts in state CTi, and any finite string s A, a, s) will represent the final output state that J<4 will enter after having processed s, one symbol at a time, from left to right. J<4 is said to accept the word s if ai,s) E the word s is rejected if and only if it is not accepted. Finally, we may define the language C JA) accepted by M as the set of all words s A that are accepted by Ad. A language C is called regular if there is a finite automaton Ad that accepts it. 

BAK, S., TAX, F.E., FELDMANN, K.A., GALBRAITH, D.W., FEYEREISEN, R., CYP83B1, A cytochrome P450 at the metabolic branch point in auxin and indole glucosinolate biosynthesis in Arabidopsis, Plant Cell, 2001,13,101-111. 

D. A. Evans, K R. Campos, J. S. Tedrow, F. E. Michael, M R. Gagne, Chiral Mixed Phosphorus/Surfur Ligands for Palladium-Catalyzed Allylic Alkylations and Amina-tions, J. Org Chem 1999, 64,2994-2995. 

---