Loading...
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...
Saved in:
| Published in: | Developments in Language Theory |
|---|---|
| Main Authors: | , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7247879/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48516-0_6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|