"Computational complexity of problems for deterministic presentations of ..."

Justin Cai, Rafael M. Frongillo (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2022.09.017

access: closed

type: Journal Article

metadata version: 2022-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/CaiF22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CaiF22
Justin Cai, Rafael M. Frongillo:
Computational complexity of problems for deterministic presentations of sofic shifts. Theor. Comput. Sci. 936: 92-115 (2022)

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.