
A superpolynomial lower bound for the size of nondeterministic complement of an unambiguous automaton
Unambiguous nondeterministic finite automata have intermediate expressi...
read it

SecondOrder Finite Automata
Traditionally, finite automata theory has been used as a framework for t...
read it

Version Space Algebras are Acyclic Tree Automata
Version space algebras are ways of representing spaces of programs which...
read it

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
We study the expressiveness and succinctness of goodforgames pushdown ...
read it

Bisimilarity in freshregister automata
Register automata are a basic model of computation over infinite alphabe...
read it

On Automata Recognizing Birecurrent Sets
In this note we study automata recognizing birecurrent sets. A set of wo...
read it

Succinct Representation for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical...
read it
Finite Automata Intersection NonEmptiness: Parameterized Complexity Revisited
The problem DFAIntersectionNonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACEcomplete. Here, we investigate this problem for the subclasses of commutative automata and automata recognizing sparse languages. We show that in both cases DFAIntersectionNonemptiness is complete for NP and for the parameterized class W[1], where the number of input automata is the parameter, when the alphabet is fixed. Additionally, we establish the same result for Tables NonEmpty Join, a problem that asks if the join of several tables (possibly containing null values) in a database is nonempty. Lastly, we show that Bounded NFAIntersectionNonemptiness, parameterized by the length bound, is W[2]hard with a variable input alphabet and for nondeterministic automata recognizing finite strictly bounded languages, yielding a variant leaving the realm of W[1].
READ FULL TEXT
Comments
There are no comments yet.