"Linear size finite automata for the set of all subwords of a word - an ..."

Anselm Blumer et al. (1983)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-06-18

- no documents available
- export record
  dblp key:
  - journals/eatcs/BlumerBEHM83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/BlumerBEHM83
Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell:
Linear size finite automata for the set of all subwords of a word - an outline of results. Bull. EATCS 21: 12-20 (1983)

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.