The Best Crossword Puzzle Maker Online
Powered by BrightSprout
Save Status:
or to save your progress. The page will not refresh.
Controls:
SPACEBAR SWITCHES TYPING DIRECTION
Answer Key:
Edit a Copy:
Make Your Own:
Crossword Word Search Worksheet
Rate This Puzzle:
Log in or sign up to rate this puzzle.

THEORY OF COMPUTATION CROSSWORD

Across
Post Correspondence Problem (PCP) [matching tiles] is _______.
Decidable languages are closed under concatenation, complement, union and ______.
NP stands for _______ Polynomial Time.
Every _____ TM with time t(n) has equivalent O(t^2(n)) time single tape TM.
To show A is decidable, construct a TM for A that always ____.
Down
For a TM, this shows the string on the tape, the machine's current state and the position of the machine on the tape.
State machine that does not need a transition for every character. If there is no transition for a particular character, it is assumed that the transition does not exist and that branch dies. We can be at multiple paths of a computation simultaneously. Just one path can be accepted to accept overall.
A TM that accepts strings in language but may not halt on all input is Turing-______.
Transforming a DFA to a CFG shows that all regular languages are ____s.
State machine with states (nodes) and transitions (edges) labeled with symbols. Needs a transition for every alphabet character on every node.
A TM that always halts is Turing-______.
Languages that can be recognized by DFAs, NFAs, or written as regular expressions.