[an error occurred while processing this directive]
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 1998, Vol. 24 Issue (4) :495-498    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�������պ����ѧ �������ѧ�빤��ϵ
Algorithm for Constructing the Simplified DFA of Regular Expressions
Tan Fengqin*
Beijing University of Aeronautics and Astronautics,Dept. of Computer Science and Engineering

Download: PDF (370KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �����˹���ȼ��ڸ���������ʽ�ļ�ȷ�������Զ���(DFA)���㷨.���������ȹ�����������ʽ�ȼ۵ķ�ȷ�������Զ���(NFA), ����ʡ���˹����ε�����������Զ����IJ���, Ȼ����״̬���������NFA�ȼ۵ļ�DFA.����㷨�ڼ��������ʵ��, ���Ҷ����������������ʽ, ����������ȼ���������ʽ�ļ�DFA.���㷨��������ijЩ��ɢ��Ϣ����ϵͳ����������.
Email Alert
�ؼ����� �����Զ���   ״̬   ״̬����   ʶ��   ״̬ͼ     
Abstract�� An algorithm for constructing the simplified DFA(Deterministic Finite Automaton) is introduced,which is equivalent to a given regular expression. The first step constructs an NFA(Nondeterministic Finite Automaton) equivalent to the regular expression, where the operation for constructing finite automata with ε-moves is omitted. Then the simplified DFA equivalent to the NFA is constructed by using state transition trees. The algorithm bas been realized by computer programming, and for any input regular expression, a simplified DFA equivalent to the regular expression is produced. The algorithm can be applied in the design and analysis of the system with discrete inputs and outputs.
Keywords�� finite automata   states   state functions   recognition   state diagrams     
Received 1998-05-11;
About author: ٠50�� ������ 100083 ����
̴����.����������ʽ�ļ�DFA�㷨[J]  �������պ����ѧѧ��, 1998,V24(4): 495-498
Tan Fengqin.Algorithm for Constructing the Simplified DFA of Regular Expressions[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 1998,V24(4): 495-498
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y1998/V24/I4/495
Copyright 2010 by �������պ����ѧѧ��