Showing revision 6
- ECFG = { <G> | G is a context free grammar, L(G)=∅ }
- ATM = { <M,w> | M is a Turing machine, w ∈ L(M) }
- HALTTM = { <M> | M is a Turing machine, M halts when run with blank tape }
- ETM = { <M> | M is a Turing machine, L(M) = ∅ }
- ADFA = {<B,w> | B is a DFA that accepts input w }
- EDFA = { <B> | B is a DFA, L(B) = ∅ }
- CONTAINS1DFA = { <B> | B is a DFA, 1 ∈ L(B) }
- 1DFA = { <B> | B is a DFA, L(B) = {1} }
- EQDFA = { <A,B> | DFA's A and B have L(A) = L(B) }
- ACFG = { <G,w> | G is a context free grammar, w ∈ L(G) }
- SEVENSTATESTM = { <M> | M is a Turing machine, M has seven states }
- REGULARTM = { <M> | M is a Turing machine, L(M) is regular }
- EQTM = { <M1,M2> | M1 and M2 are Turing machines, L(M1) = L(M2) }
- ALLTM = { <M> | M is a Turing machine, L(M) = Σ* }
- 1TM = { <M> | M is a Turing machine, L(M) = {1}
- CFTM = { <M> | M is a Turing machine, L(M) is a context-free language }
- REACHABLESTATESTM = { <M,n> | M is a Turing machine, some input causes M to use at least n states }