Advertisement

Simplified Deterministic Finite Automata Construction Algorithm from Language Specification

  • Darshan D. RuikarEmail author
  • Amruta D. Ruikar
  • Suhas G. Kulkarni
  • Ravindra S. Hegadi
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1037)

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.

Keywords

Deterministic Finite Automata Regular expression Validation rules 

Notes

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.

References

  1. 1.
    Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Ben-David, S., Fisman, D., Ruah, S.: Embedding finite automata within regular expressions. Theoret. Comput. Sci. 404(3), 202–218 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117–126 (1986)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bhargava, S., Purohit, G.: Construction of a minimal deterministic finite automaton from a regular expression. Department of Computer Science, Banasthali University (2011)CrossRefGoogle Scholar
  5. 5.
    Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in finite automata. arXiv preprint arXiv:1806.04645 (2018)
  6. 6.
    Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137–167 (1959)MathSciNetCrossRefGoogle Scholar
  7. 7.
    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)MathSciNetCrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Martin, J.C.: Introduction to Languages and the Theory of Computation, vol. 4. McGraw-Hill, New York (1991)Google Scholar
  10. 10.
    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_39CrossRefzbMATHGoogle Scholar
  11. 11.
    Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959)MathSciNetCrossRefGoogle Scholar
  12. 12.
    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_21CrossRefGoogle Scholar
  13. 13.
    Stearns, R.E., Hartmanis, J.: Regularity preserving modifications of regular expressions. Inf. Control 6(1), 55–69 (1963)MathSciNetCrossRefGoogle Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Zafar, N.A., Alsaade, F.: Syntax-tree regular expression based DFA formalconstruction. Intell. Inf. Manage. 4(04), 138 (2012)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Darshan D. Ruikar
    • 1
    Email author
  • Amruta D. Ruikar
    • 2
  • Suhas G. Kulkarni
    • 3
  • Ravindra S. Hegadi
    • 1
  1. 1.Department of Computer ScienceSolapur UniversitySolapurIndia
  2. 2.Department of Computer TechnologySolapur Education Society’s PolytechnicSolapurIndia
  3. 3.Department of BCAPrin. K.P. Mangalvedhekar Institute of Management, Career Development & ResearchSolapurIndia

Personalised recommendations