1
vote
DFA for even concatenation of strings from a language
The language you are considering is $(W^2)^*$, so you could combine standard constructions for the concatenation and the star operation.
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
finite-automata × 1738automata × 798
regular-languages × 530
formal-languages × 319
regular-expressions × 288
nondeterminism × 140
turing-machines × 81
pumping-lemma × 65
algorithms × 61
context-free × 59
pushdown-automata × 59
computability × 55
closure-properties × 54
complexity-theory × 50
formal-grammars × 48
computation-models × 40
proof-techniques × 33
compilers × 29
terminology × 22
reference-request × 22
simulation × 21
undecidability × 20
transducers × 16
graphs × 14
strings × 14