计算理论总结

计算理论复习

• 正则语言与有穷自动机

  • 可数无穷
  • 正则表达式（注意+不是正则，*是正则； $L \emptyset = \emptyset L = \emptyset$）
    $\Sigma \bigcup \lbrace(,),\emptyset, \bigcup,* \rbrace$
  • DFA
    
    • $M$ = ($K$, $\Sigma$, $\delta$, $s$, $F$) where
      $K$ is a finite set of states,
      $\Sigma$ is an alphabet,
      $s \in K$ is the initial state,
      $F\subseteq K$ is the set of final states,
      $\delta$ is the transition function form $K \times \Sigma$ to $K$
  • NFA
    
    • $M$ = ($K$, $\Sigma$, $\Delta$, $s$, $F$) where
      $K$ is a finite set of states,
      $\Sigma$ is an alphabet,
      $s \in K$ is the initial state,
      $F\subseteq K$ is the set of final states,
      $\Delta$ is the transition relation form $K \times (\Sigma\bigcup\lbrace e\rbrace) \times K$ to $K$
      
      • for each NFA, there is an equivalent DFA
        (将NFA的状态的集合变为DFA中的点)
  • closure 和 pumping theory
    
    • The class of languages accepted vy finite automata is closed under:
      
      1. union
      2. concatentenation
      3. Kleene star
      4. complementation
      5. intersection
    • A language is regular if and only if it is accepted by finite automaton
      正则表达式和DFA， NFA的相互转化按照步骤生成
    • Pumping Theory： Let $L$ be a regular language. There is an integer $n \geq 1$ such that any string $w \in L$ with $|w|\geq n$ can be rewritten as $w = xyz$ such that $y \neq e, |xy|\leq n$, and $xy^iz \in L$ for each $i \geq 0$

  Give DFA or NFA write Regular Expression
  Give regular expression, write DFA or NFA
  Show a given language is (construct) or is not regular (pumping)

• context-free and pushdown自动机

  • context-free grammar
    
    • $G$ = ($V$, $\Sigma$, $R$, $S$) where
      $V$ is an alphabet
      $\Sigma$ is the set of terminals, is a subset of $V$
      $R$ is the set of rules $(V - \Sigma) \times V^*$
      $S$ is the start Symbol, is an element of $V - \Sigma$
    • all regular languages are context-free
    • parse tree, leftmost derivation, rightmost derivation
      Grammars with strings that have two or more distinct parse trees are called ambiguous

  • PDA

    • $M$ = ($K$, $\Sigma$,