"An O(n2) Algorithm for Constructing Minimal Cover Automata for ..."

Andrei Paun, Nicolae Santean, Sheng Yu (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44674-5_20

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wia/PaunSY00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/PaunSY00
Andrei Paun, Nicolae Santean, Sheng Yu:
An O(n²) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251

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.