Problem solving in automata, languages, and complexity

Problem solving in automata, languages, and complexity

by Du

2001
Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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.

Discuss Problem solving in automata, languages, and complexity with other readers

Join or start a book club for Problem solving in automata, languages, and complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Problem solving in automata, languages, and complexity?

Sign up free on Readfeed, then browse public clubs or start your own club with Problem solving in automata, languages, and complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Problem solving in automata, languages, and complexity with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Problem solving in automata, languages, and complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.