A regular expression matching using non-deterministic finite automaton

Hiroshi Nakahara, Tsutomu Sasao, Munehiro Matsuura. A regular expression matching using non-deterministic finite automaton. In 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), Grenoble, France, 26-28 July 2010. pages 73-76, IEEE Computer Society, 2010. [doi]

@inproceedings{NakaharaSM10-1,
  title = {A regular expression matching using non-deterministic finite automaton},
  author = {Hiroshi Nakahara and Tsutomu Sasao and Munehiro Matsuura},
  year = {2010},
  doi = {10.1109/MEMCOD.2010.5558621},
  url = {http://dx.doi.org/10.1109/MEMCOD.2010.5558621},
  researchr = {https://researchr.org/publication/NakaharaSM10-1},
  cites = {0},
  citedby = {0},
  pages = {73-76},
  booktitle = {8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), Grenoble, France, 26-28 July 2010},
  publisher = {IEEE Computer Society},
}