Problem Solving in Automata, Languages and Comp Complexity

Gebonden Engels 2001 9780471439608
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9780471439608
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:408

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

Preface.
<br />
<br /> Leverages.
<br />
<br /> Finite Automata.
<br />
<br /> Context–Free Languages.
<br />
<br /> Turing Machines.
<br />
<br /> Computability Theory.
<br />
<br /> Computational Complexity.
<br />
<br /> NP–Completeness.
<br />
<br /> References.
<br />
<br /> Index.

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Problem Solving in Automata, Languages and Comp Complexity