Computation of regular expression derivatives

DOI10.1504/IJCSM.2016.077858MaRDI QIDQ2224087zbMATH OpenOpenAlexFDO

Authors O. V. Shanmuga Sundaram, N. Murugesan

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijcsm.2016.077858

zbMATH Keywords

automata theoryBoolean formulasBrzozowski's derivativesfinite-state automataregular expression derivativesregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

Summary: The conversion of regular expressions into finite state automata and finite state automata into regular expression is an important area of research in automata theory. The notion of derivatives of regular expressions has been introduced to make the construction of finite state automata from regular expressions in a natural way. Recently, a general structure has been proposed to find the derivatives of regular expressions to reduce the difficulties arising out of the earlier methods. In this paper, some properties of the derivatives of regular expressions, the quotient language, and how the derivatives are found through a general structure, have been discussed in detail.

Recommendations

• Partial derivatives of regular expressions and finite automaton constructions
• scientific article; zbMATH DE number 1773077
• Construction of state diagram of regular expressions using derivatives
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automata constructions

Cited in

(3)

• Two-sided derivatives for regular expressions and for hairpin expressions
• Derivatives for Enhanced Regular Expressions
• Simplified parsing expression derivatives

This page was built for publication: Computation of regular expression derivatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224087)