Abstract
Deterministic Finite Automata (DFA) has several real-life applications. It is a useful tool in diversified areas like pattern matching, pattern recognition, control theory, text editors, lexical analyzer, and models of software interfaces. Several methods are developed to construct a DFA using Regular Expression (RE), set of strings, derivations in RE and regular grammar. The motivation for this paper is the observation that students find DFA construction as a tedious task in the early stage of learning. This paper provides a simple solution to the standard computation-theory problem that asks a student to construct a DFA for given language description (i.e., validation rules). The presented paper keeps the concerns of beginner level students at the core.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In some references, F is also denoted as A set of accepting states.
- 2.
Reject state always has self-loop of each input symbols, as it does not show progress (i.e., no transition leads to final state).
References
Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)
Ben-David, S., Fisman, D., Ruah, S.: Embedding finite automata within regular expressions. Theoret. Comput. Sci. 404(3), 202–218 (2008)
Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117–126 (1986)
Bhargava, S., Purohit, G.: Construction of a minimal deterministic finite automaton from a regular expression. Department of Computer Science, Banasthali University (2011)
Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in finite automata. arXiv preprint arXiv:1806.04645 (2018)
Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137–167 (1959)
Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Comput. Linguist. 26(1), 3–16 (2000)
Kumar, K.S., Malathi, D.: A novel method to construct deterministic finite automata from a given regular grammar. Int. J. Sci. Eng. Res. 6(3), 106–111 (2015)
Martin, J.C.: Introduction to Languages and the Theory of Computation, vol. 4. McGraw-Hill, New York (1991)
Parekh, R., Honavar, V.: Learning DFA from simple examples. In: Li, M., Maruoka, A. (eds.) ALT 1997. LNCS, vol. 1316, pp. 116–131. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63577-7_39
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959)
Ruikar, D.D., Hegadi, R.S.: Simple DFA construction algorithm using divide-and-conquer approach. In: Nagabhushan, P., Guru, D.S., Shekar, B.H., Kumar, Y.H.S. (eds.) Data Analytics and Learning. LNNS, vol. 43, pp. 245–255. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-2514-4_21
Stearns, R.E., Hartmanis, J.: Regularity preserving modifications of regular expressions. Inf. Control 6(1), 55–69 (1963)
Tie, Y., Qiang, X., Jin, H.: A grouping algorithm based on regular expression similarity for DFA construction. In: 2011 IEEE 13th International Conference on Communication Technology (ICCT), pp. 671–674. IEEE (2011)
Zafar, N.A., Alsaade, F.: Syntax-tree regular expression based DFA formalconstruction. Intell. Inf. Manage. 4(04), 138 (2012)
Acknowledgements
Authors thank the Ministry of Electronics and Information Technology (MeitY), New Delhi for granting Visvesvaraya Ph.D. fellowship through file no. PhD-MLA\(\backslash \)4(34)\(\backslash \)201-1 Dated: 05/11/2015.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ruikar, D.D., Ruikar, A.D., Kulkarni, S.G., Hegadi, R.S. (2019). Simplified Deterministic Finite Automata Construction Algorithm from Language Specification. In: Santosh, K., Hegadi, R. (eds) Recent Trends in Image Processing and Pattern Recognition. RTIP2R 2018. Communications in Computer and Information Science, vol 1037. Springer, Singapore. https://doi.org/10.1007/978-981-13-9187-3_52
Download citation
DOI: https://doi.org/10.1007/978-981-13-9187-3_52
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-9186-6
Online ISBN: 978-981-13-9187-3
eBook Packages: Computer ScienceComputer Science (R0)