Discrete Structures and Automata Theory is designed for an introductory course on formal languages, automata and discrete mathematics. Divided into two parts it covers discrete methods - stressing the finite nature in many problems and structures; combinatorics the algebra of enumeration or coding and finite algebraic structures - effecting coding theory, method of enumeration, gating networks and combinatorial designs. It also discusses the...
Related Subjects
Computers Computers & Technology Engineering Math Mathematics Science & Math Technology