From ad3d0652ac9f802af7768c9c32f3c3bfe49f32c3 Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Thu, 7 Oct 2021 13:09:55 +0200
Subject: Comment on fixed parameters

---
 mgr.tex | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/mgr.tex b/mgr.tex
index a84c179..6f6a55e 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -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}{%
-- 
cgit v1.2.3