Automata

 

 


 

Customize your search:

E.g., 2016-12-04
E.g., 2016-12-04
E.g., 2016-12-04
Nov 28th 2016

Have you ever experienced software systems failing? Websites crash, calendar not synchronising, or even a power blackout. Of course you have! But did you know that many of these errors are the result of communication errors either within a system or between systems? Depending on the system, the impact of software failures can be huge, even resulting in massive economic damage or loss of lives. Software, and in particular the communication between software-intensive systems, is very complex and very difficult to get right. However, we _need_ dependability in the systems we use, directly or indirectly, to support us in our everyday lives.

No votes yet
Sep 21st 2015

本课程内容涵盖了形式语言与自动机理论、可计算性理论、计算复杂性理论等最基本的那部分内容。
This course covers the most basic parts of formal language and automata theory, computability theory and computational complexity theory.

No votes yet
Sep 12th 2015

This course covers finite automata, context-free grammars, Turing machines, undecidable problems, and intractable problems (NP-completeness).

Average: 8.7 (3 votes)
Self study

This course has been designed to provide you with a clear, accessible introduction to discrete mathematics. Discrete mathematics describes processes that consist of a sequence of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines.

No votes yet