{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:46:48Z","timestamp":1742996808324,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811391866"},{"type":"electronic","value":"9789811391873"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-9187-3_52","type":"book-chapter","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T05:06:16Z","timestamp":1563253576000},"page":"580-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simplified Deterministic Finite Automata Construction Algorithm from Language Specification"],"prefix":"10.1007","author":[{"given":"Darshan D.","family":"Ruikar","sequence":"first","affiliation":[]},{"given":"Amruta D.","family":"Ruikar","sequence":"additional","affiliation":[]},{"given":"Suhas G.","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Ravindra S.","family":"Hegadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"issue":"2","key":"52_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"52_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2008.03.011","volume":"404","author":"S Ben-David","year":"2008","unstructured":"Ben-David, S., Fisman, D., Ruah, S.: Embedding finite automata within regular expressions. Theoret. Comput. Sci. 404(3), 202\u2013218 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"52_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.5120\/1938-2589","volume":"15","author":"Sanjay Bhargava","year":"2011","unstructured":"Bhargava, S., Purohit, G.: Construction of a minimal deterministic finite automaton from a regular expression. Department of Computer Science, Banasthali University (2011)","journal-title":"International Journal of Computer Applications"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A., Davies, S., Madan, A.: State complexity of pattern matching in finite automata. arXiv preprint \n                    arXiv:1806.04645\n                    \n                   (2018)","DOI":"10.1016\/j.tcs.2018.12.014"},{"issue":"2","key":"52_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137\u2013167 (1959)","journal-title":"Inf. Control"},{"issue":"1","key":"52_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Comput. Linguist. 26(1), 3\u201316 (2000)","journal-title":"Comput. Linguist."},{"issue":"3","key":"52_CR8","first-page":"106","volume":"6","author":"KS Kumar","year":"2015","unstructured":"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\u2013111 (2015)","journal-title":"Int. J. Sci. Eng. Res."},{"key":"52_CR9","volume-title":"Introduction to Languages and the Theory of Computation","author":"JC Martin","year":"1991","unstructured":"Martin, J.C.: Introduction to Languages and the Theory of Computation, vol. 4. McGraw-Hill, New York (1991)"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-63577-7_39","volume-title":"Algorithmic Learning Theory","author":"R Parekh","year":"1997","unstructured":"Parekh, R., Honavar, V.: Learning DFA from simple examples. In: Li, M., Maruoka, A. (eds.) ALT 1997. LNCS, vol. 1316, pp. 116\u2013131. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/3-540-63577-7_39"},{"issue":"2","key":"52_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"52_CR12","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-981-13-2514-4_21","volume-title":"Data Analytics and Learning","author":"DD Ruikar","year":"2019","unstructured":"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\u2013255. Springer, Singapore (2019). \n                    https:\/\/doi.org\/10.1007\/978-981-13-2514-4_21"},{"issue":"1","key":"52_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0019-9958(63)90110-4","volume":"6","author":"RE Stearns","year":"1963","unstructured":"Stearns, R.E., Hartmanis, J.: Regularity preserving modifications of regular expressions. Inf. Control 6(1), 55\u201369 (1963)","journal-title":"Inf. Control"},{"key":"52_CR14","unstructured":"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\u2013674. IEEE (2011)"},{"issue":"04","key":"52_CR15","first-page":"138","volume":"4","author":"NA Zafar","year":"2012","unstructured":"Zafar, N.A., Alsaade, F.: Syntax-tree regular expression based DFA formalconstruction. Intell. Inf. Manage. 4(04), 138 (2012)","journal-title":"Intell. Inf. Manage."}],"container-title":["Communications in Computer and Information Science","Recent Trends in Image Processing and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-9187-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:07:33Z","timestamp":1565914053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-9187-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811391866","9789811391873"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-9187-3_52","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RTIP2R","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Recent Trends in Image Processing and Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Solapur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rtip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/rtip2r.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"374","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"173","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"-","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}