"Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA."

Alexandros Palioudakis, Kai Salomaa, Selim G. Akl (2014)

> Home

Details and statistics

DOI: 10.25596/JALC-2014-251

access: closed

type: Journal Article

metadata version: 2020-05-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jalc/PalioudakisSA14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jalc/PalioudakisSA14
Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. J. Autom. Lang. Comb. 19(1-4): 251-264 (2014)

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.