4
votes
Accepted
$L'=\left \{ z^Rx : xyz\in L \right \}$ is regular
Let $A = (\Sigma, Q, q_0, \delta, F)$ be a DFA that recognizes $L$. For states $p, q\in Q$, let $A_{p, q}$ denote the DFA obtained from $A$ by letting $p$ be the initial state and $q$ be the only ...
3
votes
Accepted
Myhill-Nerode sentence and the relation $R_L$
Note that $u, v$ and $w$ can contain any letter. Therefore, $L$ is the language of all words that contain some letter at least twice. In particular, a word that contains some letter 3 times is in $L$. ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
automata × 1818finite-automata × 827
formal-languages × 450
regular-languages × 384
pushdown-automata × 236
context-free × 232
regular-expressions × 184
turing-machines × 169
nondeterminism × 107
formal-grammars × 101
computability × 81
computation-models × 63
pumping-lemma × 62
complexity-theory × 46
algorithms × 42
undecidability × 42
closure-properties × 42
compilers × 32
terminology × 31
reference-request × 30
simulation × 29
proof-techniques × 27
parsers × 23
buchi-automata × 19
cellular-automata × 17