diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-07 13:09:55 +0200 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-07 13:09:55 +0200 |
commit | ad3d0652ac9f802af7768c9c32f3c3bfe49f32c3 (patch) | |
tree | 1fb0917b977671ab63b4b47888fceae1cf874faf | |
parent | 4837657588edfc98ecb61cf5ba8f76655194b937 (diff) |
Comment on fixed parameters
-rw-r--r-- | mgr.tex | 6 |
1 files changed, 6 insertions, 0 deletions
@@ -247,6 +247,12 @@ range minimum queries on the array. \subsection{Word infix regular queries}\label{wordinfix} +We now turn to a problem about regular languages. Note that the regular language +is fixed, i.e. we treat the size of its representation (e.g. the size of an +automaton representing it) as a parameter. Below we take a deterministic +automaton for convenience, but if we instead start with a nondeterministic +automaton we ``don't care'' about the exponential cost of determinizing it. + \queryproblem[% regular language $L$ over alphabet $\Sigma$, given by DFA $A$. ]{Word Infix Regular Queries}{% |