Cite
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs.
MLA
Martynova, Olga. “Complexity of the Emptiness Problem for Graph-Walking Automata and for Tilings with Star Subgraphs.” Information & Computation, vol. 296, Jan. 2024, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.ic.2023.105127.
APA
Martynova, O. (2024). Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Information & Computation, 296, N.PAG. https://doi.org/10.1016/j.ic.2023.105127
Chicago
Martynova, Olga. 2024. “Complexity of the Emptiness Problem for Graph-Walking Automata and for Tilings with Star Subgraphs.” Information & Computation 296 (January): N.PAG. doi:10.1016/j.ic.2023.105127.