Generation of regular expressions for automata by the integral of regular expressions

L. W. Smith; S. S. Yau

doi:10.1093/comjnl/15.3.222

Generation of regular expressions for automata by the integral of regular expressions

L. W. Smith, S. S. Yau

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

In this paper, the integral of regular expressions is defined and its properties are presented-The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table. The regular expression for a given automaton obtained by this algorithm is shown to be unique up to the commutative property of the sum. This algorithm is effective and suitable for machine implementation. Programmed results of this algorithm are also given and interpreted.

Original language	English (US)
Pages (from-to)	222-228
Number of pages	7
Journal	Computer Journal
Volume	15
Issue number	3
DOIs	https://doi.org/10.1093/comjnl/15.3.222
State	Published - Aug 1972
Externally published	Yes

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1093/comjnl/15.3.222

Cite this

@article{5da12ce14e2648ccabcddbc8e02ce481,

title = "Generation of regular expressions for automata by the integral of regular expressions",

abstract = "In this paper, the integral of regular expressions is defined and its properties are presented-The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table. The regular expression for a given automaton obtained by this algorithm is shown to be unique up to the commutative property of the sum. This algorithm is effective and suitable for machine implementation. Programmed results of this algorithm are also given and interpreted.",

author = "Smith, {L. W.} and Yau, {S. S.}",

year = "1972",

month = aug,

doi = "10.1093/comjnl/15.3.222",

language = "English (US)",

volume = "15",

pages = "222--228",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "3",

}

TY - JOUR

T1 - Generation of regular expressions for automata by the integral of regular expressions

AU - Smith, L. W.

AU - Yau, S. S.

PY - 1972/8

Y1 - 1972/8

N2 - In this paper, the integral of regular expressions is defined and its properties are presented-The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table. The regular expression for a given automaton obtained by this algorithm is shown to be unique up to the commutative property of the sum. This algorithm is effective and suitable for machine implementation. Programmed results of this algorithm are also given and interpreted.

AB - In this paper, the integral of regular expressions is defined and its properties are presented-The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table. The regular expression for a given automaton obtained by this algorithm is shown to be unique up to the commutative property of the sum. This algorithm is effective and suitable for machine implementation. Programmed results of this algorithm are also given and interpreted.

UR - http://www.scopus.com/inward/record.url?scp=77957178946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957178946&partnerID=8YFLogxK

U2 - 10.1093/comjnl/15.3.222

DO - 10.1093/comjnl/15.3.222

M3 - Article

AN - SCOPUS:77957178946

SN - 0010-4620

VL - 15

SP - 222

EP - 228

JO - Computer Journal

JF - Computer Journal

IS - 3

ER -

Generation of regular expressions for automata by the integral of regular expressions

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this