{"version":"1.0","type":"link","title":"Intersection non-emptiness problem - Newikis","description":"The intersection non-emptiness problem, also known as finite automaton intersection problem or the non-emptiness of intersection problem, is a PSPACE-complete decision problem from the field of automata theory. The problem asks if a list of deterministic finite automata has nonempty intersection.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}