Efficient Transformations from Regular Expressions to Finite Automata

Sebastian Seibert. Efficient Transformations from Regular Expressions to Finite Automata. In Masami Ito, Masafumi Toyama, editors, Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers. Volume 2450 of Lecture Notes in Computer Science, pages 28-42, Springer, 2002. [doi]

@inproceedings{Seibert02,
  title = {Efficient Transformations from Regular Expressions to Finite Automata},
  author = {Sebastian Seibert},
  year = {2002},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2450&spage=28},
  tags = {transformation},
  researchr = {https://researchr.org/publication/Seibert02},
  cites = {0},
  citedby = {0},
  pages = {28-42},
  booktitle = {Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers},
  editor = {Masami Ito and Masafumi Toyama},
  volume = {2450},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40431-7},
}