Problem solving in automata, languages, and complexity

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 author

Authors: Ding-Zhu D., Ker-I K.Pages: 401     Year: 2001

Tags: problem ker-i complexity ding-zhu automata solving languages
   

Customers who bought this item also bought:



Dleex

© 2007–2020 Dleex.

English      German      French      Russian

For any question please write to our email e-mail