Computability, complexity, and languages - fundamentals of theoretical computer science

Computability, complexity, and languages - fundamentals of theoretical computer science
复制标题

可计算性、复杂性和语言 - 理论计算机科学基础

DOI：
--
复制
发表时间：
2014
期刊：
Computer science and applied mathematics
影响因子：
--
通讯作者：
E. Weyuker
E. Weyuker
中科院分区：
--
文献类型：
--
作者：
Martin D. Davis;E. Weyuker

文献摘要

被引文献

相似文献

Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. Polynomial Time Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.