Computing epsilon-free NFA from regular expressions in O(n log:::2:::(n)) time - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Christian Hagenah, Anca Muscholl. Computing epsilon-free NFA from regular expressions in O(n log:::2:::(n)) time. ITA, 34(4):257-278, 2000.

@article{HagenahM00,
  title = {Computing epsilon-free NFA from regular expressions in O(n log:::2:::(n)) time},
  author = {Christian Hagenah and Anca Muscholl},
  year = {2000},
  tags = {Epsilon},
  researchr = {https://researchr.org/publication/HagenahM00},
  cites = {0},
  citedby = {0},
  journal = {ITA},
  volume = {34},
  number = {4},
  pages = {257-278},
}

runs on WebDSL