Skip to main content
SpringerLink
Log in

Simplified Deterministic Finite Automata Construction Algorithm from Language Specification

  • Conference paper
  • First Online:
Recent Trends in Image Processing and Pattern Recognition (RTIP2R 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1037))

  • 1039 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In some references, F is also denoted as A set of accepting states.

  2. 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

  1. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)

    Article  MathSciNet  Google Scholar 

  2. Ben-David, S., Fisman, D., Ruah, S.: Embedding finite automata within regular expressions. Theoret. Comput. Sci. 404(3), 202–218 (2008)

    Article  MathSciNet  Google Scholar 

  3. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117–126 (1986)

    Article  MathSciNet  Google Scholar 

  4. Bhargava, S., Purohit, G.: Construction of a minimal deterministic finite automaton from a regular expression. Department of Computer Science, Banasthali University (2011)

    Article  Google Scholar 

  5. Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in finite automata. arXiv preprint arXiv:1806.04645 (2018)

  6. Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137–167 (1959)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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. Martin, J.C.: Introduction to Languages and the Theory of Computation, vol. 4. McGraw-Hill, New York (1991)

    Google Scholar 

  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_39

    Chapter  MATH  Google Scholar 

  11. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  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_21

    Chapter  Google Scholar 

  13. Stearns, R.E., Hartmanis, J.: Regularity preserving modifications of regular expressions. Inf. Control 6(1), 55–69 (1963)

    Article  MathSciNet  Google Scholar 

  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. Zafar, N.A., Alsaade, F.: Syntax-tree regular expression based DFA formalconstruction. Intell. Inf. Manage. 4(04), 138 (2012)

    Google Scholar 

Download references

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

  1. Department of Computer Science, Solapur University, Solapur, 413255, Maharastra, India

    Darshan D. Ruikar & Ravindra S. Hegadi

  2. Department of Computer Technology, Solapur Education Society’s Polytechnic, Solapur, 413002, Maharastra, India

    Amruta D. Ruikar

  3. Department of BCA, Prin. K.P. Mangalvedhekar Institute of Management, Career Development & Research, Solapur, 413001, Maharastra, India

    Suhas G. Kulkarni

Authors
  1. Darshan D. Ruikar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amruta D. Ruikar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Suhas G. Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ravindra S. Hegadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Darshan D. Ruikar .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of South Dakota, Vermillion, SD, USA

    K. C. Santosh

  2. Solapur University, Solapur, India

    Ravindra S. Hegadi

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation