• 検索結果がありません。

(1) 本問を選択

N/A
N/A
Protected

Academic year: 2021

シェア "(1) 本問を選択"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

オートマトン (1)

本問を選択

(Select this problem) {

する

(Yes)

,しない

(No) } No.

Let A be the following automaton.

A = ( { 0, 1, 2, 3, 4 } , { 0, 1 } , δ, 0, { 3 } )

δ(0, 0) = 0, δ(1, 0) = 1, δ(2, 0) = 2, δ(3, 0) = 3, δ(4, 0) = 4, δ(0, 1) = 1, δ(1, 1) = 2, δ(2, 1) = 3, δ(3, 1) = 4, δ(4, 1) = 0 (1) Construct the graph representation (transit diagram) of A.

(2) Explain whether A recognizes (accepts) word 00001010001 or not.

(3) What is the second shortest word automaton A recognizes (accepts).

(4) Construct a regular expression representing the language automaton A recognizes (accepts).

A

は次のオートマトンであるとする。

A = ( { 0, 1, 2, 3, 4 } , { 0, 1 } , δ, 0, { 3 } )

δ(0, 0) = 0, δ(1, 0) = 1, δ(2, 0) = 2, δ(3, 0) = 3, δ(4, 0) = 4, δ(0, 1) = 1, δ(1, 1) = 2, δ(2, 1) = 3, δ(3, 1) = 4, δ(4, 1) = 0 (1)

オートマトン

A

のグラフ表現

(

状態遷移図

)

を描け。

(2)

オートマトン

A

は語

00001010001

を認識

(

受理

)

するかどうか説明せよ。

(3)

オートマトン

A

が認識

(

受理

)

する

2

番目に短い語は何か。

(4)

オートマトン

A

が認識

(

受理

)

する言語を表現する正規表現をつくれ。

(

解答は裏面を使用しても構わない.

You can use the reverse side of this paper for your answering.)

(2)

オートマトン (2)

本問を選択

(Select this problem) {

する

(Yes)

,しない

(No) } No.

Fig.1 illustrates four lamps and two switches. Switch A flips between its ON and OFF for the leftmost lamp and the third lamp from the left. For example, if switch A is pushed when the leftmost lamp is ON and the third lamp from the left is OFF, then the leftmost lamp changes into OFF and the third lamps from the left changes into ON, and the other lamps have no change. Similarly, all states of lamps except the leftmost lamp change reversely, if switch B is pushed. By using automata, explain that it is impossible to have a configuration in which only the leftmost and the rightmost lamps are ON by pushing switches A and B starting from a configuration in which all lamps are OFF.

1

のように

4

つの電球と

2

つのスイッチ

A, B

がある

.

スイッチ

A

を押すと、一番左と左から

3

番目の電球

ON/OFF

が逆になる

.

例えば

,

一番左の電球がついていて

(ON)

左から

3

番目の電球がついていない

(OFF)

ときにスイッチ

A

を押すと一番左の電球が消え

,

左から

3

番目の電球がつき

,

それ以外の電球の状態は変わら ない

.

同様にスイッチ

B

を押すと

,

一番左以外の

3

つの電球の

ON/OFF

が逆になる

.

すべての電球がついて いない状態からスタートし

,

適当にスイッチ

A, B

を何回か押すことにより

,

両端の電球だけつくようにできな いことを

,

オートマトンを使って説明せよ

.

A B

1.

スイッチ

A

B.

Fig.1 Switches A and B .

(

解答は裏面を使用しても構わない.

You can use the reverse side of this paper for your answering.)

参照

関連したドキュメント

this result is re-derived in novel fashion, starting from a method proposed by F´ edou and Garcia, in [17], for some algebraic succession rules, and extending it to the present case

Figure 7: The coding of the boundary of a polyomino, starting from A and moving in a clockwise sense; its salient (resp. reentrant) points are indicated by black (resp. A

Since we are interested in bounds that incorporate only the phase individual properties and their volume fractions, there are mainly four different approaches: the variational method

Thus, starting with a bivariate function which is a tensor- product of finitely supported totally positive refinable functions, the new functions are obtained by using the

Global transformations of the kind (1) may serve for investigation of oscilatory behavior of solutions from certain classes of linear differential equations because each of

7.1. Deconvolution in sequence spaces. Subsequently, we present some numerical results on the reconstruction of a function from convolution data. The example is taken from [38],

We study infinite words coding an orbit under an exchange of three intervals which have full complexity C (n) = 2n + 1 for all n ∈ N (non-degenerate 3iet words). In terms of

We will study the spreading of a charged microdroplet using the lubrication approximation which assumes that the fluid spreads over a solid surface and that the droplet is thin so