Theoretical Aspects of Lexical Analysis/Exercise 19: 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

14 April 2015

  • curprev 09:3309:33, 14 April 2015‎ Root talk contribs‎ 457 bytes +457‎ 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 Σ..."
Retrieved from "https://www.hlt.inesc-id.pt/~david/w/pt/Theoretical_Aspects_of_Lexical_Analysis/Exercise_19"