/computation

Understanding Computation: From Simple Machines to Impossible Programs

Primary LanguageSwift

Understanding Computation: From Simple Machines to Impossible Programs

Rewrite some Ruby code in this book (中译《计算的本质》) with Swift.

Build

swift build

Run

  • DFA, Deterministic Finite Automation (确定性有限自动机), swift run dfa
  • NFA, Nondeterministic Finite Automaton (非确定性有限自动机), swift run nfa
  • RE, Regular Expression (正则表达式), swift run re
  • DPDA, Deterministic PushDown Automaton (确定性下推自动机), swift run dpda
  • NPDA, Nondeterministic PushDown Automaton (非确定性下推自动机), swift run npda
  • TM, Turing Machine (图灵机), swift run tm

Contact

@nixzhu