Problem Solving in Automata, Languages and Comp Complexity
Gebonden Engels 2001 9780471439608Samenvatting
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
Lezersrecensies
Inhoudsopgave
<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.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan