41080 Theory of Computing Science Notes
Subject notes for UTS 41080
Description
Detailed & concise notes on 41080. Including examples with drawn graphs. Topics - Regular languages and Finite Automata - Context free languages and Push Down Automata - Turing Machines and Computablility - Computational Complexity
UTS
Spring session, 2019
24 pages
3,416 words
$39.00
1
Campus
UTS, Broadway & Markets
Member since
January 2017
Other related note