"Between finite state and Prolog: constraint-based automata for efficient ..."

Klaus U. Schulz, Tomek Miko Lajewski (1996)

> Home

Details and statistics

DOI: 10.1017/S1351324997001630

access: closed

type: Journal Article

metadata version: 2020-03-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/nle/SchulzL96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nle/SchulzL96
Klaus U. Schulz, Tomek Miko Lajewski:
Between finite state and Prolog: constraint-based automata for efficient recognition of phrases. Nat. Lang. Eng. 2(4): 365-366 (1996)

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.