Авторизация 
		         
		        
					
 
		          
		        
			          
		        
			        Поиск по указателям 
		         
		        
			        
					 
		          
		        
			          
			
			         
       		 
			          
                
                    
                        
                     
                  
		
			          
		        
			          
		
            
	     
	    
	    
            
		
                    Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures 
                  
                
                    
                        
                            
                                
                                    Обсудите книгу на научном форуме    Нашли опечатку? 
 
                                
                                    Название:   Discrete Mathematical StructuresАвторы:   Kolman B., Busby R.C., Ross S.Аннотация:  Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed. The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees.
Язык:  Рубрика:  Математика /Статус предметного указателя:  Готов указатель с номерами страниц ed2k:   ed2k stats Издание:  3-rd editionГод издания:  1996Количество страниц:  544Добавлена в каталог:  23.01.2014Операции:  Положить на полку  |
	 
	Скопировать ссылку для форума  | Скопировать ID 
                                 
                             
                        
                     
                 
                                                                
			          
                
                    Предметный указатель 
                  
                
                    
                        Factor semigroup 344 Factorial, n 75 Fibonacci sequence 95 Finite group 352 Finite sequence 14 Finite set 4 Finite-state machine 391 Finite-state machine, congruence on 393 Finite-state machine, digraph of 393 Finite-state machine, input set of 391 Finite-state machine, monoid of 400 Finite-state machine, quotient of 394 Finite-state machine, state of 391 Finite-state machine, state set of 391 Finite-state machine, state transition table of 391 Fleury's algorithm 209 Floor function 84 178 Flow chart 447 for statement 452 Formula, explicit 15 Formula, recursive 15 Free monoid 398 Free semigroup 335 Frequency of occurrence of E in n trials 88 Function 167 Function statement 453 Function, argument of 168 Function, base 2 exponential       178 Function, boolean 179 Function, ceiling 178 Function, characteristic, of a set 17 177 Function, decoding associated with e 432—433 Function, distance 424 Function, encoding 422 Function, everywhere defined 171 Function, floor 84 178 Function, hashing 179 Function, identity 170 Function, invertible 173 Function, log base 2 178 Function, maximum likelihood decoding 434 Function, mod n 28 177 Function, one to one 171 Function, onto 171 Function, permutation 181 Function, propositional 49 Function, state transition 391 Function, state transition, corresponding to a string       398 Function, value of 168 Fundamental Homomorphism Theorem 345 Gate, and 268 Gate, or 268 GO TO statement 446 454—455 Grammar 370 Grammar, context-free 376 Grammar, context-sensitive 376 Grammar, phrase structure 370 grammar, regular 376 Grammar, Type n (n=0, 1, 2, 3) 376 Graph 197 Graph of a symmetric relation 127 Graph, coloring of 218 Graph, complete 200 Graph, components of 199 Graph, connected 199 Graph, disconnected 199 Graph, discrete 200 Graph, linear 200 Graph, path in 199 Graph, planar 219 Graph, quotient 202 Graph, regular 200 Graph, sub- 200 Graph, weighted 321 Greatest common divisor 24 Greatest element of a poset 240 Greatest lower bound 242 Greedy algorithm 323 Group code 425 Group(s) 349 Group(s) of symmetries of the triangle 355 Group(s), Abelian 349 Group(s), alternating, on n letters 356 Group(s), code 425 Group(s), cyclic 473 Group(s), finite 352 Group(s), inverse in 349 Group(s), Klein 4 359 Group(s), normal subgroup of 363 Group(s), order of 352 Group(s), product of 361 Group(s), quotient 362 Group(s), subgroup of 356 Group(s), symmetric, on n letters 355 Hamiltonian circuit 213 Hamiltonian path 213 Hamming distance 424 Hashing function 179 Hasse diagram 231 Height of a tree 288 Homogeneous linear relation of degree k 96 Homomorphic image 339 Homomorphism of semigroups 339 Homomorphism, fundamental theorem 345 Homomorphism, kernel of 364 Homomorphism, natural 345 Hypotheses 59 Hypothesis 52 Idempotent element 341 Idempotent properties of a binary operation 332 Idempotent properties of a lattice 251 Idempotent properties of a set 10 Idempotent properties of logical operations 56 Identity of a binary operation 41 Identity, element 335 Identity, function 170 Identity, matrix 34 IF THEN ELSE statement 446 449 Image of a 168 Image, homomorphic 339 Implication 52 Implication, contrapositive of 53 Implication, converse of 53 Impossible event 87 In-degree of a vertex 113 Incomparable elements of a poset       235 Indirect method of proof 61 Induction step 64 Induction, principle of mathematical 64 Inequality relation 124 Inference, rules of 59 Infinite sequence 14 Infinite set 4 Infix notation 304 Influence two-stage 475 Initial conditions for a recurrence relation 95 Inorder search of a tree 303 Input of a machine 391 Input set of a machine 391 Input-output relation 169 Interior vertices of a path 159 Intersection of sets 6 Interval in a lattice 257 Invariant loop 68 Inverse of a binary operation 41 Inverse of an element 349 Inverse, relation 146 Inverter 269 Invertible function 173 Involution property in a Boolean algebra 263 Irreflexive relation 124 Isolated vertex 199 Isomorphic lattices 250 Isomorphic posets 234 Isomorphic semigroups 337 Join of two elements in a lattice 246 Join of two matrices 35 k or fewer errors 422 433 Karnaugh map 274 Kernel 364 Key 179 Klein 4 group 359 Kruskal's algorithm 324—325 Labeled digraph 169 Labeled tree 292 Language of a Moore machine 402 Language of a phrase structure grammar 371 Language, semantics of 369 Language, syntax of 369 Language, Type n (n=0, 1, 2, 3) 376 Lattice(s) 246 Lattice(s), absorption properties of 252 Lattice(s), associative properties of 251 Lattice(s), bounded 253 Lattice(s), commutative properties of 251 Lattice(s), complemented 255 Lattice(s), distributive 253 Lattice(s), distributive properties of 253 Lattice(s), idempotent properties of 251 Lattice(s), isomorphic 250 Lattice(s), modular 257 Lattice(s), nondistributive 253 Lattice(s), sub- 249 Laws, De Morgan's 10 41 56 263 Laws, distributive 253 Least common multiple 26 Least element of a poset 240 Least upper bound 242 Leaves of a tree 288 Left cancellation property 350 Left coset of a subgroup 363 Left pointer 295 Left side of production 370 Left subtree 300 Lemma 133 Length of a path 116 Length of a string 376 401 Less than relation 125 Level in a tree 287 Level n vertices 287 Level, same 449 Lexicographic order 228 lg, log base 2 function       180 Likelihood, maximum decoding function 434 Likelihood, maximum technique 434 Linear array 16 Linear graph 200 Linear homogeneous relation of degree k 96 Linear order 227 Linearly ordered set 227 Linked-list representation of a relation 138—139 Linked-list representation of a sequence 136—138 Linked-list representation of a tree 306 LIST 16 List, doubly linked 295 Local variable 454 Log base 2 function       178 Logic diagram 269 Logic gate 268 Logical connectives 47—49 Logically equivalent propositions (statements) 55 Logically follows 59 Loop 198 447 Loop invariant 68 Lower bound 242 Lower class 192 Lower order 191 Machine(s), congruence 393 Machine(s), equivalent 413 Machine(s), finite-state 391 Machine(s), input set of 391 Machine(s), input(s) of 391 Machine(s), language of 402 Machine(s), monoid of 400 Machine(s), Moore 393 Machine(s), output of 391 Machine(s), quotient 394 Machine(s), quotient Moore 396 Machine(s), recognition 393 Machine(s), state of 391 Machine(s), state set of 391 Machine(s), state transition function of 391 Machine(s), state transition table of 391 Main diagonal of a matrix 30 Map, Karnaugh 274 Mapping 168 Markov chain 468 Markov chain, regular 469 Markov chain, state vector of 468 Master diagram of a regular grammar 387 Mathematical induction, principle of 64 Mathematical structure 39 Mathematical system 39 Matrices, Boolean product of 36 Matrices, equal 31 Matrices, join of 35 Matrices, meet of 35 Matrices, mod 2 Boolean product of       427 Matrices, mod 2 sum of       426 Matrices, product of 32 Matrices, sum of 31 Matrix 30 Matrix of a relation 111 Matrix, (i, j) entry of 30 Matrix, (i, j)th element of 31 Matrix, Boolean 35 Matrix, Boolean, complement of 148 Matrix, column of 30 Matrix, diagonal 31 Matrix, element of 31 Matrix, identity 34 Matrix, main diagonal of 30 Matrix, parity check 429 Matrix, row of 30 Matrix, square 30 Matrix, symmetric 34 Matrix, transition 468 Matrix, transpose of 34 Matrix, zero 32 Maximal compatibility block 464 Maximal element of a poset 239 Maximum likelihood decoding function 434 Maximum likelihood technique 434 Meet of two elements in a lattice 247 Meet of two matrices 35 Message 421 Minimal element of a poset 239 Minimal spanning tree 322 Minimum distance of an encoding function 424 Minterm 272 Mod 2 Boolean product       427 Mod 2 sum       426 Mod n function 28 178 Modular lattice 257 Modulus 27 modus ponens 60 Monoid 335 Monoid of a machine 400 Monoid, idempotent element in 341 Monoid, sub-       336 
                            
                     
                  
			Реклама