News
A survey of the mathematical foundations of Computer Science. Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable ...
Leonard P. Sasso, Jr., Deficiency Sets and Bounded Information Reducibilities, Transactions of the American Mathematical Society, Vol. 200 (Dec., 1974), pp. 267-290 ...
A survey of the mathematical foundations of Computer Science. Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback