"Computing epsilon-free NFA from regular expressions in O(n ..."

Christian Hagenah, Anca Muscholl (2000)

> Home

Details and statistics

DOI: 10.1051/ITA:2000116

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/HagenahM00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/HagenahM00
Christian Hagenah, Anca Muscholl:
Computing epsilon-free NFA from regular expressions in O(n log²(n)) time. RAIRO Theor. Informatics Appl. 34(4): 257-278 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.