"State complexity of permutation on finite languages over a binary alphabet."

Da-Jung Cho et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.03.007

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/ChoGHKPS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChoGHKPS17
Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa:
State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682: 67-78 (2017)

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.