Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs

Olga Martynova 0001. Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput., 296:105127, January 2024. [doi]

@article{Martynova24,
  title = {Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs},
  author = {Olga Martynova 0001},
  year = {2024},
  month = {January},
  doi = {10.1016/j.ic.2023.105127},
  url = {https://doi.org/10.1016/j.ic.2023.105127},
  researchr = {https://researchr.org/publication/Martynova24},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {296},
  pages = {105127},
}