"On the Subword Complexity and Square-Freeness of Formal Languages."

Andrzej Ehrenfeucht, Grzegorz Rozenberg (1981)

> Home

Details and statistics

DOI: 10.1007/BFB0017289

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tcs/EhrenfeuchtR81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tcs/EhrenfeuchtR81
Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On the Subword Complexity and Square-Freeness of Formal Languages. Theoretical Computer Science 1981: 1-4

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.