Loading...
Please wait, while we are loading the content...
Similar Documents
Electronic Communications of the EASST Volume 39 ( 2011 ) Graph Computation Models Selected Revised Papers from the Third International Workshop on Graph Computation Models ( GCM 2010 ) Minimizing Finite Automata with Graph Programs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Plump, Detlef Suri, Robin Singh, Ambuj K. |
| Copyright Year | 2011 |
| Abstract | GP (for Graph Programs) is a rule-based, nondeterministic p rogramming language for solving graph problems at a high level of ab str ction, freeing programmers from dealing with low-level data structures. I n this case study, we present a graph program which minimizes finite automata. The program represents an automaton by its transition diagram, computes the state e quivalence relation, and merges equivalent states such that the resulting automaton is mi imal and equivalent to the input automaton. We illustrate how the program works b y a running example and argue that it correctly implements the minimization algorithm of Hopcroft, Motwani and Ullman. We also prove a quadratic upper bound for the number of rule schema applications used by the program. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://journal.ub.tu-berlin.de/eceasst/article/download/658/669 |
| Alternate Webpage(s) | https://journal.ub.tu-berlin.de/eceasst/article/download/658/669 |
| Alternate Webpage(s) | http://www.cs.york.ac.uk/plasma/publications/pdf/PlumpSuriSingh.ECEASST.11.pdf |
| Alternate Webpage(s) | https://www.cs.york.ac.uk/plasma/publications/pdf/PlumpSuriSingh.ECEASST.11.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |