"Complexity of the emptiness problem for graph-walking automata and for ..."

Olga Martynova (2024)

> Home

Details and statistics

DOI: 10.1016/J.IC.2023.105127

access: closed

type: Journal Article

metadata version: 2024-02-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/Martynova24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Martynova24
Olga Martynova:
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput. 296: 105127 (2024)

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.