Case Study 2: Classifying MADFA Construction Algorithms
The previous chapter illustrated the potency of software correctness by construction for developing a new and elegant algorithm. In this chapter we focus on classifying and taxonomising algorithmic problems by relying on correctness by construction thinking.
KeywordsStart State Regular Language Transition Graph Structural Invariant Deterministic Finite Automaton
- 16.E. Fredkin, Trie memory. Commun. ACM 3(9), 490–499 (1960)Google Scholar
- 43.B.W. Watson, Minimizing acyclic deterministic finite automata, Ph.D., FASTAR Research Group, Department of Computer Science, University of Pretoria, South Africa, 2011Google Scholar
- 44.B.W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, Ph.D. thesis, Eindhoven University of Technology, Faculty of Computing Science, September 1995Google Scholar
- 45.B.W. Watson, in CIAA 2000, ed. by Yu, Păun. Directly constructing minimal DFAs: Combining two algorithms by Brzozowski (2000), pp. 242–249Google Scholar