Top/LanguageExamples

Top | Top | recent changes | Preferences

E_CFG = { <G> | G is a context free grammar, L(G)=∅ }

A_TM = { <M,w> | M is a Turing machine, w ∈ L(M) }
HALT_TM = { <M> | M is a Turing machine, M halts when run with blank tape }
E_TM = { <M> | M is a Turing machine, L(M) = ∅ }

A_DFA = {<B,w> | B is a DFA that accepts input w }
E_DFA = { <B> | B is a DFA, L(B) = ∅ }
CONTAINS1_DFA = { <B> | B is a DFA, 1 ∈ L(B) }
1_DFA = { <B> | B is a DFA, L(B) = {1} }
EQ_DFA = { <A,B> | DFA's A and B have L(A) = L(B) }
A_CFG = { <G,w> | G is a context free grammar, w ∈ L(G) }
SEVENSTATES_TM = { <M> | M is a Turing machine, M has seven states }

REGULAR_TM = { <M> | M is a Turing machine, L(M) is regular }
EQ_TM = { <M1,M2> | M1 and M2 are Turing machines, L(M1) = L(M2) }
ALL_TM = { <M> | M is a Turing machine, L(M) = Σ^* }
1_TM = { <M> | M is a Turing machine, L(M) = {1} }
CF_TM = { <M> | M is a Turing machine, L(M) is a context-free language }
REACHABLESTATES_TM = { <M,n> | M is a Turing machine, some input causes M to use at least n states }