Implementation of State Elimination Using Heuristics
-
Upload
kareem-sellers -
Category
Documents
-
view
27 -
download
1
description
Transcript of Implementation of State Elimination Using Heuristics
![Page 1: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/1.jpg)
1
Implementation of State Elimination Using
HeuristicsAuthor: Jae-Hee Ahn, Yo-Sub HanPublisher: CIAA 2009Presenter: Li-Hsien, HsuData: 5/9/2012
![Page 2: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/2.jpg)
2
Introduction
![Page 3: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/3.jpg)
3
Introduction
![Page 4: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/4.jpg)
4
Introduction
The size of a regular expression from state elimination depends on the state removal sequence.
2 -> 4
4 -> 2
![Page 5: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/5.jpg)
5
Heuristics for State EliminationThe Decomposition Heuristic
vertical decomposition horizontal decomposition
The State Weight Heuristic
![Page 6: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/6.jpg)
6
Vertical DecompositionDefinition 1. We define a state q in an FA A to be a bridge
state if it satisfies the following conditions:1. State q is neither a start nor a final state.2. For each string w ∈ L(A), its path in A must pass through q at least once.3. State q is not in any cycle except for the self-loop.
![Page 7: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/7.jpg)
7
Vertical Decomposition
![Page 8: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/8.jpg)
8
Horizontal DecompositionFor horizontal chopping of a given FA A = (Q,Σ, δ, s, f), we
have to identify subautomata of A such that all subautomata are disjoint from each other except s and f.
![Page 9: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/9.jpg)
9
The State Weight Heuristic
![Page 10: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/10.jpg)
10
The State Weight Heuristic
(1*2)+(1*1+1*1)+5*(1*2) = 14
Out = 2
In = 1
![Page 11: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/11.jpg)
11
C-IEliminate states in order. C-IIUsing VC & HC, and eliminateStates in order. C-IIIUsing SWH only once. C-IVUsing VC & HC, and eliminateStates with SWH only once. C-VUsing SWH in every steps. C-VIUsing VC & HC, and eliminateStates with SWH in every steps.
![Page 12: Implementation of State Elimination Using Heuristics](https://reader036.fdocuments.net/reader036/viewer/2022062517/56813283550346895d991ed2/html5/thumbnails/12.jpg)
12