Problem Solving in Automata, Languages, and Complexity

Problem Solving in Automata, Languages, and Complexity

Authors : Ding-Zhu Du, Ker-I Ko
Publisher : John Wiley & Sons
Published Date : 2004-04-05
ISBN-13 : 9780471464082
Page : 408 Pages
Language : en


Descriptions Problem Solving in Automata, Languages, and Complexity

Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.

Related Post


    Theory of Computational Complexity
    Handbook of Combinatorial Optimization
    Multiwavelength Optical Networks
    Design and Analysis of Approximation Algorithms
    Connected Dominating Set

About apujb86