FORMAL Language 2019 HW-3 Problem 1 Find a regular expression for the set ${a^nb^m: (n+m)$ is odd $}$. ==Solution== Either the number of $a$'s is odd and the number of $b$'s is even or vise versa. A regular expression is $(aa)^(a + b)(bb)^$. Problem 2 Give regular expressions for the following languages. 1. $L_1={a^nb^m: n\ge 3, m\le 4}$

FORMAL Language 2019 HW-2 Problem 1 Convert the nfa defined by $$ \begin{array}{lll} \delta(q_0,a)={q_0,q_1}\ \delta(q_1,b)={q_1,q_2}\ \delta(q_2,a)={q_2}\ \end{array} $$

FORMAL Language 2019 HW-1 Scope of the homework (ch2-1 ~ ch2-2) Problem 1 Give dfa's for the languages A. $L={ab^4wb^2: w\in {a,b}^*}$ ==Solution== The key is that any string that can be accept by the solution dfa must consist $ab^4$ at the begining and two $b$'s at the end. The first requirement is straightforward, and the second requirement is solved between states $q_5$ to $q_7$.

分散式計算實驗室 DCLAB 實驗室成員 博士班 姓名 Name 聯絡信箱 論文 賴家瑞

分散式計算實驗室 DCLAB 實驗室畢業校友 姓名 Name 聯絡信箱 論文 江姝昀 Shu-Yun Jiang

分散式計算實驗室 DCLAB簡介 所謂的“格網計算“（Grid）如同網際網路提供了資訊一個虛擬平台，一般目的是希望透過寬頻網路連結分散之相關資源，建構一個可以有掌握，統合計算與資料的資訊基礎設施（基礎設施） ，以有效整合計算能量，嵌入式系統，儲存設備，感測節點，資料庫，軟體，以及各領域專業知識及資訊共享虛擬平台，嵌入於各領域的應用。 主要的格網架構依應用型態與特性可概分為：以資料共享，儲存資源共享，快速存取與傳輸分散式資料為主要目的之“嵌入式資料格網“（ EmbeddedDataGrid ） ，及以應用共享式，協同式，分散式計算網路以迅速獲取資料處理結果為主要目的之“嵌入式計算格網“（嵌入式計算網格） ，兩者重要開發關鍵目標皆為“整合異質平台及簡化複雜網路架構“ ，便利於資料整合分析。 研究領域 容錯計算

--- tags: DCLab title: DCLab --- # Distributes Computing Laboratory > Advisor: Chang-Hsiung Tsai [中文版](/@dclab/home) - [Home](/@dclab/en-home) - [Advisor](/s/HyPSEoW5Q) - [About DCLAB](/@dclab/en-about) - [Lab Members](/@dclab/en-member) - [Alumni](/@dclab/en-alumni) --- **Home**|<a href="https://hackmd.io/s/HyPSEoW5Q" target="_self">Advisor</a>|<a href="https://hackmd.io/@dclab/en-about" target="_self">About</a>|<a href="https://hackmd.io/@dclab/en-member" target="_self">Members</a>|<a href="

--- tags: DCLab title: 分散式計算實驗室 --- # 分散式計算實驗室 > 指導教授: 蔡正雄教授 [ENG ver.](/@dclab/en-home) - [首頁](/@dclab/home) - [指導教授](/s/HyPSEoW5Q) - [關於 DCLAB](/@dclab/about) - [實驗室成員](/@dclab/member) - [實驗室校友](/@dclab/alumni) --- **首頁**|<a href="https://hackmd.io/s/HyPSEoW5Q" target="_self">指導教授</a>|<a href="https://hackmd.io/@dclab/about" target="_self">簡介</a>|<a href="https://hackmd.io/@dclab/member" target="_self">成員</a>|<a href="https://hackmd.io/@dclab/alumni" target="_self">校友</a> 2019 (c) NDHU D

--- tags: Formal Language 2019 title: Final --- <style> img { margin: auto; display: block; } </style> # FORMAL Language 2019 Final ## Q1. (10 points) Find an s-grammar for the language $L = \{a^nb^{n+1} : n \ge 3\}$. ==**Solution**== $$ \begin{array}{ll} S & \rightarrow & aS_1B\\ S_1 & \rightarrow & aXABB\\ A & \rightarrow & aAB|b\\ B & \rightarrow & b\\ X & \rightarrow & a\\ \end{array} $$ --- ##

--- tags: Formal Language 2019 title: HW-04 --- <style> img { margin: auto; display: block; } </style> # FORMAL Language 2019 HW-4 ## reference : others ## Problem 1 Construct a dfa that accepts the language generated by the grammar $$ \begin{array}{lll} S & \rightarrow & abS|A,\\ A & \rightarrow & baB,\\ B & \rightarrow & aA|bb.\\ \end{array} $$ ==**Solution**== It is straightforward to construct a nfa for the given grammar with a $\lambda$-tra

--- tags: DCLab title: Alumni | DCLab --- <h1><a href="https://hackmd.io/@dclab/en-home" target="_self">Distributes Computing Laboratory</a></h1> ## DCLAB Alumni | 姓名 | Name | Mail | Thesis | | ---- | -----| ------ | --- | | 江姝昀|Shu-Yun Jiang |forminekimo@yahoo.com.tw|Analysis of Peer-to-Peer SCORM Learning SystemsAnalysis of Peer-to-Peer SCORM Learning Systems | |廖經凱|Jing-Kai Liao|tenoken@gmail.com|Constructing One-to Many Disjoint Paths in Crossed Cube| |賴勇均|Yung-Chun Lai|ai_yung@hotmail.c

--- tags: DCLab title: Member | DCLab --- <h1><a href="https://hackmd.io/@dclab/en-home" target="_self">Distributes Computing Laboratory</a></h1> ## DCLAB Member ### Doctoral Students | 姓名 | Name | Mail | Thesis | | -----| ----- | -------- | -- | | 賴家瑞 | | d9821004@ems.ndhu.edu.tw| | ### Master Students | 姓名 | Name | Mail| | -------- | -------- | -------- | | 呂祐寧 | Yu-Ning Lu | 610721230@gms.ndhu.edu.tw | | 許博軒 |Bo-hsuan Hsu | steven860720@gmail.com | 鄭喆文 |Zhe-Wen Chang |410421201@gms

--- tags: DCLab title: About | DCLab --- <h1><a href="https://hackmd.io/@dclab/en-home" target="_self">Distributes Computing Laboratory</a></h1> ## About DCLAB The so-called "grid computing" (grid) that provides information on a virtual platform for a general purpose is used to scatter resources through a broadband Internet connection, build a good grasp and for the integration of computing and data information infrastructure (Internet infrastructure) in order to effectively integrate energy, e

--- tags: Formal Language 2019 title: Mid-term --- <style> img { margin: auto; display: block; } </style> # FORMAL Language 2019 Mid-term ## Q1. (10 points) Design n nfa with no more than five states for the set $\{abab^n : n\ge0\} \cup \{aba^n : n\ge0\}.$ **Solution:**  --- **Another solution:** ```graphviz digraph problem5 { rankdir=LR; size="8,5" node [shape = none]; "" node [shape = doublecircle]; " " " "; node [sh

--- tags: Formal Language 2019 title: HW-05 --- <style> img { margin: auto; display: block; } </style> # FORMAL Language 2019 HW-5 ## reference : others ## Problem 1 Prove or disprove the following statement: If $L_1$ and $L_2$ are nonregular languages, then $L_1\cup L_2$ is also nonregular. **Solution:** The proposition is false. As a counterexample, take $L_1 = \{a^nb^m : n \le m\}$ and $L_2 = \{a^nb^m : n > m\}$, both of which are non-regular. But $L1 \cup L2 = L (