"Complexity of bifix-free regular languages."

Robert Ferens, Marek Szykula (2019)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.09.016

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/FerensS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FerensS19
Robert Ferens, Marek Szykula:
Complexity of bifix-free regular languages. Theor. Comput. Sci. 787: 14-27 (2019)

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.