Paper Title:
Study on the Automation Method of Regular Expression to Finite Automaton
  Abstract

Regular expression was the foundation of advanced language and compiler. It can be recognized by finite automaton. In this paper, combined with operator priority analysis and the rules of regular expression, the table of priority relationship between operators involved in regular expression has be constructed. Based on the table, realized the automatic convert from regular expression to finite automaton, and the program is given. It provided a new reference of regular expression convert to finite automaton.

  Info
Periodical
Edited by
Shengyi Li, Yingchun Liu, Rongbo Zhu, Hongguang Li, Wensi Ding
Pages
1493-1496
DOI
10.4028/www.scientific.net/AMM.34-35.1493
Citation
Q. Cao, X. Y. Huang, K. K. Wang, J. Yin, "Study on the Automation Method of Regular Expression to Finite Automaton", Applied Mechanics and Materials, Vols. 34-35, pp. 1493-1496, 2010
Online since
October 2010
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Hao Hu, Yu Jun Lu, Hua Wu Luo
Chapter 17: Digital Manufacture and Management
Abstract:The product structure evolution caused by maintenance activity was important constituent part of Product Lifecycle Management, but it has not...
3010
Authors: Yan Liu, You Guang Chen
Chapter 2: Information Technologies and Information Processing Algorithms
Abstract:A new method to obtain connected component in binary images is presented. The method uses DFA automaton to obtain chain code and label the...
1402