New answers tagged computability
0
For Automata Theory, get the 1979 edition of "Automata Theory, Languages and Computation". Unlike the 3rd edition, it is not an introductory book, but goes into lots of detail about all the specifics of automata theory. It covers things like trios, cones, abstract families of languages, etc. that most undergrad books skip.
Top 50 recent answers are included
Related Tags
computability × 363turing-machines × 81
cc.complexity-theory × 60
reference-request × 53
lo.logic × 49
pl.programming-languages × 32
automata-theory × 26
fl.formal-languages × 22
decidability × 20
universal-computation × 17
halting-problem × 16
lambda-calculus × 15
machine-models × 15
complexity-classes × 14
randomness × 13
soft-question × 11
kolmogorov-complexity × 10
computing-over-reals × 10
undecidability × 10
cellular-automata × 10
ds.algorithms × 9
computable-analysis × 9
type-theory × 8
oracles × 8
time-complexity × 7