On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
Mateus de Oliveira Oliveira, Michael Wehar
Topics & Concepts
Parameterized complexityNondeterministic algorithmExponential time hypothesisIntersection (aeronautics)CombinatoricsDiscrete mathematicsTime complexityDTIMEMathematicsBounded functionAutomatonTuring machineComputer scienceComputationAlgorithmTheoretical computer scienceUniversal Turing machineEngineeringAerospace engineeringMathematical analysissemigroups and automata theoryComplexity and Algorithms in GraphsAdvanced Graph Theory Research