Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machine theory --- Computational Complexity --- Formal languages --- Computational complexity --- 681.3*F11 --- 681.3*F2 --- 681.3*F4 --- 681.3*F41 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formalization (Linguistics) --- Language and languages --- Complexity, Computational --- Electronic data processing --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Mathematical logic and formal languages (Theory of computation) --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Computable functions --- Fonctions calculables --- Fonctions calculables. --- Informatique --- Computer science --- Langages formels --- Langages de programmation --- Programming languages (Electronic computers) --- Computer science. --- Formal languages. --- Logique mathématique --- Algorithmique --- Complexite