|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions Hiroaki YAMAMOTO Hiroshi FUJIWARA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2021/03/01
Vol. E104-D
No. 3
pp. 381-388
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends of Theory of Computation and Algorithm —) Category: Keyword: regular expression, nondeterministic finite automaton, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|