| 词条 | Book:Theory Of Computation |
| 释义 |
|title= |subtitle= |cover-image= |cover-color=}} Theory Of ComputationDecision Problems and Complexity
Kleene star Regular expression Prefix grammar Regular language Regular grammar Linear grammar Deterministic finite automaton Nondeterministic finite automaton Moore machine Mealy machine Pumping lemma for regular languages
Context-free grammar Dependency grammar Pushdown automaton Deterministic pushdown automaton Context-free language Pumping lemma for context-free languages Attribute grammar CYK algorithm
Context-sensitive grammar Context-sensitive language Turing machine Linear bounded automaton Non-deterministic Turing machine Universal Turing machine Turing completeness Turing degree Recognizable language Recursively enumerable language Recursive language Chomsky normal form
Chomsky hierarchy Backus–Naur Form Decision problem Undecidable problem PCP SAT List of undecidable problems Complete (complexity) Reduction (complexity) Time complexity NP (complexity) Co-NP NP-hard NP-complete Co-NP-complete Halting problem P versus NP problem List of NP-complete problems PSPACE-complete EXPTIME Polynomial hierarchy Space hierarchy theorem List of PSPACE-complete problems 1 : Wikipedia books on mathematics |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。