跳到主要内容

東京大学 情報理工学系研究科 コンピュータ科学専攻 2022年2月実施 問題3

Author​

zephyr

Description​

Let . Answer the following questions.

(1) Give a non-deterministic finite state automaton with 3 states that accepts the following language.

(2) Show the minimal deterministic finite state automaton that accepts the language given in question (1).

(3) Prove that the following language over is not regular. You may use the pumping lemma for regular languages.

Here, denotes the reverse of . For example, .

(4) Is the language in question (3) a context-free language? If it is, construct a context-free grammar that generates . If not, prove that is not a context-free language.

让 。回答以下问题。

(1) 给出一个具有 3 个状态的非确定性有限状态自动机，该自动机接受以下语言。

(2) 展示接受问题 (1) 中给出的语言的最小确定性有限状态自动机。

(3) 证明以下语言 在 上不是正则的。你可以使用正则语言的泵引理。

这里， 表示 的反转。例如，。

(4) 问题 (3) 中的语言 是上下文无关语言吗？如果是，构造一个生成 的上下文无关文法。如果不是，证明 不是上下文无关语言。

Kai​

(1)​

A non-deterministic finite state automaton (NFA) with 3 states that accepts the language can be constructed as follows:

  • States:
  • Alphabet:
  • Start state:
  • Accept state:
  • Transition function:

The state diagram for the NFA is as follows:

graph LR
    q0 -->|a,b| q0
    q0 -->|b| q1
    q1 -->|a| q2
    q1 -->|b| q0
    q2 -->|a| q0
    q2 -->|b| q1

(2)​

To construct the minimal deterministic finite state automaton (DFA) for the language , we can use the subset construction method to convert the NFA to a DFA.

We can represent the NFA as a DFA with the following states:

This DFA is minimal and accepts the language .

The transition table for the DFA is as follows:

So we can construct the minimal DFA as follows:

  • States:
  • Alphabet:
  • Start state:
  • Accept state:
  • Transition function:

The state diagram for the minimal DFA is as follows:

graph LR
    Q0 -->|a| Q0
    Q0 -->|b| Q1
    Q1 -->|a| Q2
    Q1 -->|b| Q1
    Q2 -->|a| Q0
    Q2 -->|b| Q1

(3)​

To prove that the language is not regular, we will use the pumping lemma for regular languages.

Pumping Lemma for Regular Languages​

If is a regular language, then there exists a pumping length such that any string with can be split into three parts satisfying the following conditions:

  3. for all

Let , and consider the string . According to the pumping lemma, can be decomposed into such that the conditions are met.

  • Let , , where and .

If we pump , the resulting string is .

This string is not in because it does not match the form where . Thus, is not a regular language.

(4)​

To determine whether is a context-free language, we can use the context-free grammar (CFG) approach.

Constructing a CFG for ​

We need to create a CFG that generates strings of the form where .

A CFG that generates this language can be defined as follows:

  • Non-terminals:
  • Terminals:
  • Start symbol:
  • Production rules:

This CFG generates strings of the form by recursively placing matching symbols and around the center substring .

Therefore, is a context-free language.

Knowledge​

NFA DFA 正则语言 泵引理 上下文无关语言

难点解题思路​

对于问题 3，使用抽象的语言对泵引理的证明往往会遇到困难。我们选择具体的字符串 并展示在不同情况下的行为以证明该语言非正则性。问题 4 则是运用构造法，结合递归的生成规则，清晰地表达语言的上下文无关性质。

解题技巧和信息​

  1. NFA 转换为 DFA 时，确保考虑每种状态转换的可能性，尽量简化状态数量。
  2. 利用泵引理证明非正则性时，选择一个能覆盖所有可能情况下的字符串。
  3. 构造 CFG 时，利用递归规则可以简洁地表达嵌套的结构。

重点词汇​

  • Non-deterministic finite state automaton (NFA) 非确定性有限状态自动机
  • Deterministic finite state automaton (DFA) 确定性有限状态自动机
  • Pumping Lemma 泵引理
  • Context-free grammar (CFG) 上下文无关文法
  • Regular language 正则语言
  • Context-free language 上下文无关语言

参考资料​

  1. "Introduction to the Theory of Computation" by Michael Sipser, Chapters 1-2 for Automata and Regular Languages, Chapter 4 for Context-Free Grammars.
目录