Locality Testing for NFAs is PSPACE-complete
By: Antoine Amarilli, Mikaël Monet, Rémi De Pretto
Potential Business Impact:
Checks if a computer program is "local" fast.
The class of local languages is a well-known subclass of the regular languages that admits many equivalent characterizations. In this short note we establish the PSPACE-completeness of the problem of determining, given as input a nondeterministic finite automaton (NFA) A, whether the language recognized by A is local or not. This contrasts with the case of deterministic finite automata (DFA), for which the problem is known to be in PTIME.
Similar Papers
Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
Formal Languages and Automata Theory
Makes computers check if word patterns match faster.
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
Formal Languages and Automata Theory
Makes computers understand all languages perfectly.
Saturation Problems for Families of Automata
Formal Languages and Automata Theory
Makes computer programs understand repeating patterns faster.