diff options
| author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-12-16 17:18:52 +0100 |
|---|---|---|
| committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-12-16 17:18:52 +0100 |
| commit | 7640db6a7f2a38de46445f33d67027ee40351fc9 (patch) | |
| tree | 38fa90da7224803fa0803fd9bc32f41b9e3d7aff | |
| parent | b597f77205713addf49cf2c5a7741d19142f2021 (diff) | |
Use same convention for DFA
| -rw-r--r-- | mgr.tex | 3 |
1 files changed, 1 insertions, 2 deletions
@@ -511,8 +511,7 @@ its own. The question answering problem we will solve is: \queryproblem[% - regular language $L$ over alphabet $\Sigma$, given by deterministic - automaton $A$. + regular language $L$ over alphabet $\Sigma$, given by DFA $A$. ]{Branch Infix Regular Questions}{% a $\Sigma$-labeled tree $T$. }{% |