summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
...
* 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
|
* Clarifications on Kleene's star, and the empty word.David A. Madore2016-11-081-8/+37
|
* More about languages.David A. Madore2016-11-071-4/+106
|
* Languages (start).David A. Madore2016-11-071-5/+66
|
* Concatenation, prefixes, suffixes, factors and subwords.David A. Madore2016-11-071-0/+126
|
* Start writing course notes.David A. Madore2016-11-071-0/+198
|
* Be slightly more precise on what is expected about computability.David A. Madore2016-11-041-1/+5
|
* Slight clarifications on proposed curriculum.David A. Madore2016-11-041-6/+9
|
* Fix course number.David A. Madore2016-11-041-1/+1
|
* Notes on computability.David A. Madore2016-11-041-0/+605
|
* Planned curriculum for INF105.David A. Madore2016-11-042-0/+147
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-23 23:09:49 +0000