4 ms·
I disagree. Automata theory has important practical applications -- most string processing turns out to be finite automata (hence regular expressions), and pus
by csense 13y ago
I disagree. Automata theory has important practical applications -- most string processing turns out to be finite automata (hence regular expressions), and push-down automata are very important to understand if you're writing a compiler.
- j2kun 13y agoYou disagree with what? I never said anything about practical applications. And you'd better bet that complexity theory (and the world of topics that basic familiarity with complexity theory opens) has more important applications. Cryptography, combinatorial optimization, approximation algorithms, communication complexity, machine learning theory, need I go on? All I'm saying is that automata theory doesn't give the glimpse into theoretical computer science that every "introductory theory" textbook ought to.