Theoretical Aspects of Lexical Analysis/Exercise 25: Revision history

View logs for this page

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

5 December 2018

6 July 2018

  • curprev 07:5907:59, 6 July 2018‎ Root talk contribs‎ 575 bytes +575‎ Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). The alphabet is Σ = {..."
Retrieved from "https://www.hlt.inesc-id.pt/~david/w/pt/Theoretical_Aspects_of_Lexical_Analysis/Exercise_25"