MFCS
2007
Springer
14 years 5 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
CIE
2007
Springer
14 years 5 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
151
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.