Cargando…
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
We study the fine grained complexity of the DFA non-emptiness of intersection problem parameterized by the number k of input automata (k -DFA-NEI). More specifically, we are given a list [Formula: see text] of DFA’s over a common alphabet [Formula: see text], and the goal is to determine whether [Fo...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247879/ http://dx.doi.org/10.1007/978-3-030-48516-0_6 |