Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Computer Science

Editor-in-Chief: van den Broek, Egon


Covered by:
SCOPUS
Web of Science - Emerging Sources Citation Index


CiteScore 2018: 0.63
Source Normalized Impact per Paper (SNIP) 2018: 0.604

ICV 2018: 97.86

Open Access
Online
ISSN
2299-1093
See all formats and pricing
More options …

Deterministic automata for extended regular expressions

Mirzakhmet Syzdykov
Published Online: 2017-12-07 | DOI: https://doi.org/10.1515/comp-2017-0004

Abstract

In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

Keywords: automaton; extended operators; overriding; intelligent complexity; subset construction

References

  • [1] K. Thompson, Regular expression search algorithm, Comm. ACM, 11 (6), 1968. - pp. 419-422.Google Scholar

  • [2] G. Berry, R. Sethi, From regular expressions to deterministic automata, Theoretical Computer Science, 48, 1986. - pp. 117-126.CrossrefGoogle Scholar

  • [3] M. Syzdykov, Algorithm to Generate DFA for AND-operator in Regular Expression, International Journal of Computer Applications (0975-8887), Volume 124 - No. 8, 2015. - pp. 31-34.Google Scholar

  • [4] Pascal Caron, Djelloul Ziadi, Characterization of Glushkov automata, Theoretical Computer Science, 233, 2000. - pp. 75-90.Web of ScienceGoogle Scholar

  • [5] Brzozowski, Janusz A, Derivatives of regular expressions, Journal of the ACM, 11(4), 1964. - pp. 481- 494.CrossrefGoogle Scholar

  • [6] M.O. Rabin, D. Scott, Finite automata and their decision problems, IBM J. Res. Develop., 3 (2), 1959. - pp. 114- 125.Google Scholar

  • [7] Koushik Sen, Grigore Rosu, Generating optimal monitors for extended regular expressions, Electronic Notes in Theoretical Computer Science 89 No. 2, 2003. - pp. 226 - 245.Google Scholar

About the article

Received: 2016-11-18

Accepted: 2017-10-31

Published Online: 2017-12-07

Published in Print: 2017-12-20


Citation Information: Open Computer Science, Volume 7, Issue 1, Pages 24–28, ISSN (Online) 2299-1093, DOI: https://doi.org/10.1515/comp-2017-0004.

Export Citation

© 2017 Mirzakhmet Syzdykov. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. BY-NC-ND 4.0

Comments (0)

Please log in or register to comment.
Log in