000			01165cam a2200193 a 4500
020			_a9780534490966
020			_a0534490964 (international student ed.)
082	0	0	_a510 _bEPP
100	1		_aEpp, Susanna S.
245	1	0	_aDiscrete mathematics with applications /
250			_a3rd ed.
260			_aBelmont, CA : _bThomson-Brooks/Cole, _cc2004.
300			_axix, 775, 116, 11 p. : _bill. (some col.) ;
500			_aIncludes index.
505			_aThe logic of compound statements -- The logic of quantified statements -- Elementary number theory and methods of proof -- Sequences and mathematical induction -- Set theory -- Counting and probability -- Functions -- Recursion -- The efficiency of algorithms -- Relations -- Graphs and trees -- Regular expressions and finite-state automata.
520			_aThis textbook for computer science and math majors describes processes that consist of a sequence of individual steps, and explains the concepts of logic, proof, induction, recursion, algorithms, and discrete structures. The third edition adds a chapter on finite-state automata, and sections on modu
650		0	_aMathematics.
942			_cREF
999			_c44359 _d44359