@article{oai:soar-ir.repo.nii.ac.jp:02001210,
 author = {Yamamoto, Hiroaki and Fujiwara, Hiroshi},
 issue = {3},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {Mar},
 note = {This paper presents a new method to translate a regular expression into a nondeterministic finite automaton (an NFA for short). Let r be a regular expression and let M be a Thompson automaton for r. We first introduce a labeled Thompson automaton defined by assigning two types of expressions which denote prefixes and suffixes of words in L(r) to each state of M. Then we give new ϵ-free NFAs constructed from a labeled Thompson automaton. These NFAs are called a prefix equation automaton and a suffix equation automaton. We show that a suffix equation automaton is isomorphic to an equation automaton defined by Antimirov. Furthermore we give an NFA called a unified equation automaton by joining two NFAs. Thus the number of states of a unified equation automaton can be smaller than that of an equation automaton., Article, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E104D(3) : 381-388(2021)},
 pages = {381--388},
 title = {A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions},
 volume = {E104D},
 year = {2021}
}