Marknadens största urval
Snabb leverans
Om Computability, Complexity, and Languages

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780122063824
  • Format:
  • Inbunden
  • Sidor:
  • 609
  • Utgiven:
  • 18 Mars 1994
  • Utgåva:
  • 2
  • Mått:
  • 162x236x48 mm.
  • Vikt:
  • 1018 g.
Leveranstid: 2-4 veckor
Förväntad leverans: 9 Juli 2024

Beskrivning av Computability, Complexity, and Languages

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.

Användarnas betyg av Computability, Complexity, and Languages



Hitta liknande böcker
Boken Computability, Complexity, and Languages finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.