Special

Changes related to "Theoretical Aspects of Lexical Analysis"

Theoretical Aspects of Lexical Analysis

This is a list of changes made recently to pages linked from a specified page (or to members of a specified category). Pages on your watchlist are bold.

Recent changes options
Legend:
N
This edit created a new page (also see list of new pages)
m
This is a minor edit
b
This edit was performed by a bot
(±123)
The page size changed by this number of bytes
Show last 50 | 100 | 250 | 500 changes in last 1 | 3 | 7 | 14 | 30 days
Hide minor edits | Show bots | Hide anonymous users | Hide registered users | Hide my edits

Show new changes starting from 20:29, 27 April 2024
   
Page name:

23 April 2024

N    20:44  Theoretical Aspects of Lexical Analysis/Exercise 11‎ (diff | hist) . . (+517). . Root (talk | contribs) (Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ...")
     20:40  Theoretical Aspects of Lexical Analysis/Exercise 17‎‎ (2 changes | history) . . (-11,039). . [Root‎ (2×)]
      20:40 (cur | prev) . . (+39). . Root (talk | contribs) (Solution)
      19:46 (cur | prev) . . (-11,078). . Root (talk | contribs) (Replaced content with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is...")