APA (7th ed.) Citation

Gejdmanis, D. Unsolvability of the emptiness problem for alternating 1-way multi-head and multi-tape finite automata over single-letter alphabet.

Chicago Style (17th ed.) Citation

Gejdmanis, Dainis. Unsolvability of the Emptiness Problem for Alternating 1-way Multi-head and Multi-tape Finite Automata over Single-letter Alphabet.

MLA (9th ed.) Citation

Gejdmanis, Dainis. Unsolvability of the Emptiness Problem for Alternating 1-way Multi-head and Multi-tape Finite Automata over Single-letter Alphabet.

Warning: These citations may not always be 100% accurate.