TY - BOOK ID - 136820 TI - Introduction to the theory of computation. PY - 1997 SN - 053494728X 9780534947286 PB - London International Thomson Publishing Ltd. DB - UniCat KW - Programming KW - Computer science KW - Machine theory KW - Computational complexity KW - Automates mathématiques, Théorie des KW - Complexité de calcul (Informatique) KW - Machine theory. KW - Computational complexity. KW - #TELE:SISTA KW - 681.3*F KW - 681.3*F13 KW - 681.3*F41 KW - 681.3*F42 KW - 681.3*F43 KW - Abstract automata KW - Abstract machines KW - Automata KW - Mathematical machine theory KW - Algorithms KW - Logic, Symbolic and mathematical KW - Recursive functions KW - Robotics KW - Complexity, Computational KW - Electronic data processing KW - Theory of computation KW - Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} KW - 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} KW - Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} KW - Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} KW - 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} KW - 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} KW - 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} KW - 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} KW - 681.3*F Theory of computation KW - Automates mathématiques, Théorie des KW - Complexité de calcul (Informatique) UR - https://www.unicat.be/uniCat?func=search&query=sysid:136820 AB - ER -