Regulation Of Gene Expression Books
Languages and Machines, 3rd edition
Author: Thomas Sudkamp
School: Edo University
Department: Science and Technology
Course Code: CSC314
Topics: Languages, regular expression, text searching, grammars, automata, languages, Chomsky normal form, finite automata, deterministic finite automata, Myhill-Nerode theorem, homky, undecidability, Rice's theorem, Mu-recursive functions, numeric computation, incomputable functions, linear-bounded automata, computational complexity, linear speedup, Hamiltonian circuit problem, polynomial-time reduction, satisfiability problem, complexity class relations, optimization problems, approximation algorithms, approximation schemes, space complexity, deterministic parsing
Introduction to Automata Theory, Languages, and Computation, 3rd edition
Author: John Hopcroft, Rajeev Motwani, Jeffrey Ullman
School: Edo University
Department: Science and Technology
Course Code: CSC314
Topics: Automata Theory, Languages, Computation, finite automata, regular expressions, ContextFree Grammars, Pushdown Automata, Turing machines, Undecidability, Intractable Problems
Fundamentals of Logic Design, 7th edition
Author: Charle Roth, Larry Kinney
School: Edo University
Department: Engineering
Course Code: EEE314
Topics: Logic Design, number system, Boolean algebra, minterm expansions, maxterm expansions, Karnaugh maps, Quine-McCluskey Method, Multi-Level Gate Circuits, NAND gate, NOR Gate, Combinational Circuit Design, Multiplexers, Decoders, Programmable Logic Devices, Latches, Flip-Flops, VHDL, registers, counters, Clocked Sequential Circuits, Sequential Circuit Design, digital systems, switching circuits, number systems, number conversion, binary arithmetic, Boolean expression, truth tables, De Morgan's laws, Consensus Theorem, Prime Implicant Chart, Petrick’s Method, Three-State Buffers, Read-Only Memories, encoders, Shift Registers
An Introduction to Formal Languages and Automata, 6th edition
Author: Peter Linz
School: Edo University
Department: Science and Technology
Course Code: CSC314
Topics: finite automata, regular expressions, regular languages, parsing, turing machines, algorithmic computation, recursive functions, computational complexity
Java in Two Semesters,4th edition
Author: Quentin Charatan, Aaron Kans
School: Edo University
Department: Science and Technology
Course Code: CSC314
Topics: Java, compiling programs, integrated development environments, arrays, classes, Lambda expressions, Advanced JavaFX, JavaFX
Engineering a compiler, 2nd edition
Author: Keith Cooper, Linda Torczon
School: Edo University
Department: Science and Technology
Course Code: CSC312
Topics: scanners, regular expression, Top-Down Parsing, parsing, Expressing Syntax, Bottom-Up Parsing, Context-Sensitive Analysis, Intermediate Representations, Procedure Abstraction, code shape, Arithmetic Operators, Boolean operators, relational operators, character strings, procedure calls, Data-Flow Analysis, Iterative Data-Flow Analysis, Interprocedural Analysis, scalar optimizations, code motion, Instruction Scheduling, register allocation, Local Register Allocation, Global Register Allocation
Concepts of Programming Languages, 10th Edition
Author: Robert Sebesta
School: Edo University
Department: Science and Technology
Course Code: CSC413
Topics: Programming Languages, programming environments, Pseudocodes, functional programming, computerizing business records, time sharing, dynamic languages, object-oriented programming, scripting languages, programming hybrid languages, lexical analysis, syntax analysis, parsing problem, recursive descent parsing, variables, datatypes, array types, associative arrays, arithmetic expressions, subprograms, abstract data types, data abstraction, concurrency, exception handling, event handling, functional programming languages, logic programming languages
An Introduction to English Grammar ,Third edition
Author: Gerald Nelson, Sidney Greenbaum
School: Federal University, Oye-Ekiti
Department: Arts and Humanities
Course Code: ELS103
Topics: Grammar, verb, object, sentence, subject, transitive verb, direct object, linking verb, subject complement, intransitive verb, adverbials, adverbial complement, indirect object, Word classes, Noun, noun suffix, noun classes, gender, dependent genitive, independent genitive, verb suffix, regular verb, irregular verb, auxilliaries, passive auxiliary, progressive auxilliary, modal auxiliaries, modals, adjective, perfect auxiliary, adjective suffix, adjective class, adverb, pronoum, personal pronoun, possessive pronoun, reflexive pronoun, demonstrative pronoun, reciprocal pronoun, interrogative pronoun, relative pronoun, determiners, conjuction, preposition, phrase, clause, noun phrase, tense, aspect, mood, multi-word verb, adjective phrase, prepositional phrase, sentence, declarative, interrogative, imperative, exclamative, speech act, active sentence, passive sentence, positive sentence, negative sentence, compound sentence, subject-verb agreement, multiple negation, dangling modifiers, emphasis, Parenthetic expressions, cleft sentences, abstract noun, parallelism, repeated sounds, unscripted monologue, punctuation, punctuation rules, direct speech, snetence fragment, fragmentary sentence, spelling, spelling variants
Author: Nancy Woods
School: University of Ibadan
Department: Science and Technology
Course Code: CSC213
Topics: Digital Logic Design, Kirchhoff's law, Thevenin's theorem, Norton's theorem, circuit theory, semiconductors, transistors, digital logic, integrated circuits, digital logic gates, logic gates, combinational logic design, logic circuit diagram, truth table, Boolean expression, Boolean Algebra, Karnaugh Maps, Quine-McCluckskey, standard combinational logic circuits, ombinational logic circuits, combinational logic, binary adder, binary subtractor, digital comparator, multiplexer, digital encoder, binary decoder, sequential logic circuit, Flip-Flop, S-R Flip-Flop, JK Flip-Flop, T Flip-Flop, D-type Flip-Flop, registers, counters, computer codes, binary codes, binary-coded decimal, excess-3 code, gray code, error detection, error correction, digital error, parity bit, Hamming codes, Cyclic redundancy check
Introduction to Languages and the Theory of Computation ,4th edition
Author: John Martin
School: University of Ibadan
Department: Science and Technology
Course Code: CSC242
Topics: Computation, languages, Mathematical Tools, Regular Expressions, Nondeterminism, Kleene’s Theorem, Context-Free Languages, Finite Automata, Pushdown Automata, Non-Context-Free Languages, Undecidable Problems, Decision Problems Involving Turing Machines, turing machines, computable functions, Recursively Enumerable Languages, Computational Complexity
Departments
Administration, Social and Management science
Agriculture and Veterinary Medicine
Arts and Humanities
Education
Engineering
General studies
Law
Medical, Pharmaceutical and Health science
Science and Technology