这周换一个方法记录blog，以记录自己想记录的东西为主。

在language的大集合里，有一部分语言被作为regular languages，测试他们是否是regular languages的方法是使用DFA & NFA & RL，pumpling lemma得出了有一部分语言是unregular的，unregular的语言不可以用DFA NFA Regular expression去define。这是就需要Grammar（content free grammar） which可以define regular languages and unregular languages

Content-free Grammar

G = (V, A, S, P)
V is a set of variables.
A is constant, terminates 阿尔法贝塔
S is a variable, state symoble
P is a set of rules (production) eg: x -> a a属于(VUA)^* 类似转移方程？
都是有限集
S –> aSb content-free意味着ab对S没有影响
L(G) = {w|wEA*, s->w}

这周的内容：

• UML类图
• 时序图
• 状态图
• 活动图

老师讲的ppt太寄了，建议自己学习。

This’s the note of System Modeling.

• Context models
• Interaction models
• Structural models
• Behavioral models
• Model-driven engineering

这周各种东西要记的也太多了吧。。。

还没整明白，内容转自吴雨森的CSDN。
INT201 决策，计算，语言 笔记

This is the note of CPT203 W5.
This week is mainly about Human Aspect and SE Principles.
其实感觉这周主要说的是如何处理团队中的人际关系问题。和如何提高团队的运作效率。

This’s the note of INT201 Week4.
This week will focus on 正则语言的性质.

The objectives of this week:

• understand the concepts of user and system requirements and why these requirements should be written in different ways;
• understand the differences between functional and nonfunctional software requirements;
• understand how requirements may be organized in a software requirements document;
• understand the principal requirements engineering activities of elicitation, analysis and validation, and the relationships between these activities;

It’s the note of week3. (INT201 W3)

This week we will focus on two topics:

1. Scrum Framework
2. Agile Methods - Background

This is the note of INT201 Week2. The lecture is still focusing on decision, computation and language.

Alphabet A,
A* = {alll strings consisting symbols from A}
A subset L of A* is called a language
Question: For a language L, does exist an algorithm to check for any x, if x is in L?