summaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Clarifications following students' remarks/questions.David A. Madore2016-12-131-3/+5
* Add a simple exercise.David A. Madore2016-12-121-0/+21
* Typo.David A. Madore2016-12-121-1/+1
* Explain how to produce a regexp that matches the multiples of 7 in base 10.David A. Madore2016-12-092-1/+78
* Exercise on multiples of 7 in base 10.David A. Madore2016-12-091-0/+26
* Exercise on backreferences.David A. Madore2016-12-092-11/+82
* Test various egrep features.David A. Madore2016-12-092-0/+69
* A simple exercise on using egrep.David A. Madore2016-12-092-0/+212
* Clarify decidability of equivalence of automata or regexps.David A. Madore2016-12-081-8/+52
* Mention the name "Kleene's algorithm".David A. Madore2016-12-081-1/+3
* A clarification on elimination of states.David A. Madore2016-12-081-24/+33
* Remark on elimination of spontaneous transitions and automaton transpose.David A. Madore2016-12-081-33/+84
* Slight changes to section titles.David A. Madore2016-12-081-5/+5
* Example(s) of minimization algorithm.David A. Madore2016-12-085-0/+215
* Leading zeros in powers of two.David A. Madore2016-12-021-1/+1
* Remove any ambiguity about whether 0 is a power of two (it is not).David A. Madore2016-12-011-1/+1
* Moore's algorithm (further description).David A. Madore2016-12-011-3/+33
* Various clarifications. Try to explicitate when DFAs need to be complete.David A. Madore2016-12-011-52/+72
* Fix mistake in determinization of automaton.David A. Madore2016-12-012-11/+13
* Moore's algorithm.David A. Madore2016-11-301-2/+89
* The Myhill-Nerode theorem.David A. Madore2016-11-301-0/+87
* Using the pumping lemma.David A. Madore2016-11-301-49/+128
* Typo (thanks, Olivier).David A. Madore2016-11-301-1/+1
* The pumping lemma.David A. Madore2016-11-301-1/+64
* Clarifications.David A. Madore2016-11-301-9/+11
* Fix mistake in minimization of automaton.David A. Madore2016-11-302-28/+30
* Re-read exercise sheet.David A. Madore2016-11-301-23/+25
* Exercise on determinizing and minimizing an automaton.David A. Madore2016-11-305-0/+303
* Another exercise on rational languages.David A. Madore2016-11-291-0/+25
* Write an exercise on rational languages.David A. Madore2016-11-292-0/+228
* More remarks about regexp syntax in the computer world.David A. Madore2016-11-281-1/+38
* Remarks on regexp notations in the real computer world.David A. Madore2016-11-251-10/+85
* Example of state elimination.David A. Madore2016-11-254-1/+116
* Regexp-labeled automata, equivalence with NFAs and with regexps.David A. Madore2016-11-251-0/+216
* Various additional remarks on regular expressions.David A. Madore2016-11-251-33/+52
* Use "denote" for the relation between a regular expression and a language.David A. Madore2016-11-251-28/+36
* Rational languages are recognizable.David A. Madore2016-11-251-29/+148
* Stability of recognizable languages under boolean operations and mirror.David A. Madore2016-11-251-10/+140
* NFAs with spontaneous transitions: equivalence.David A. Madore2016-11-252-9/+123
* Define ε-closure.David A. Madore2016-11-231-2/+12
* NFAs with spontaneous transitions.David A. Madore2016-11-233-16/+144
* NFAs and determinization of them.David A. Madore2016-11-233-15/+284
* Trimming of incomplete DFAs.David A. Madore2016-11-231-8/+31
* Incomplete DFAs. Change formating of self-loops in graphs.David A. Madore2016-11-236-42/+236
* Accessible and inaccessible states.David A. Madore2016-11-232-11/+73
* More on DFAs.David A. Madore2016-11-232-28/+131
* Start defining DFAs, and give a first example (typeset with dot2tex + TikZ).David A. Madore2016-11-142-9/+101
* More clarifications on rational languages and expressions.David A. Madore2016-11-141-8/+28
* Mirror (=transpose) word, palindromes.David A. Madore2016-11-091-0/+12
* Rational languages and rational expressions.David A. Madore2016-11-091-0/+127
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-23 06:36:02 +0000