Top/LanguageExamples
Top
|
Top
|
recent changes
|
Preferences
Difference (from prior major revision)
(no other diffs)
Changed: 20c20
* 1
TM
= { <M> | M is a Turing machine, L(M) = {1}
* 1
TM
= { <M> | M is a Turing machine, L(M) = {1} }
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 }