Automata, computability and complexity
Rich, Elaine
Automata, computability and complexity theory and applications - New Delhi Pearson Education 2015 - xx, 1099 p. : ill. ; 25 cm.
Includes index.
9788131788226 (pbk)
Machine theory
Computable functions--Electronic data processing--Computational complexity--Finite machine--Turing machine--Semidecidable language--Computable function--Logical formulas --Programming tools--Algorithms--Networks--FEAS--FC
511.3 / RIC
Automata, computability and complexity theory and applications - New Delhi Pearson Education 2015 - xx, 1099 p. : ill. ; 25 cm.
Includes index.
9788131788226 (pbk)
Machine theory
Computable functions--Electronic data processing--Computational complexity--Finite machine--Turing machine--Semidecidable language--Computable function--Logical formulas --Programming tools--Algorithms--Networks--FEAS--FC
511.3 / RIC