An intersection problem for finite automata

AbstractA finite automaton with state space S and alphabet A can be thought of as a directed graph with vertex set S such that for each vertex t ϵ S the edges leaving t are in one-to-one correspondence with A. Motivated by a problem in logic, we propose a problem about intersections of languages accepted by finite automata and give some partial results