APA (7th ed.) Citation
(2022). Bounded Reachability Problems are Decidable in FIFO Machines. Logical Methods in Computer Science.
Chicago Style (17th ed.) Citation
"Bounded Reachability Problems Are Decidable in FIFO Machines." Logical Methods in Computer Science 2022.
MLA (9th ed.) Citation
"Bounded Reachability Problems Are Decidable in FIFO Machines." Logical Methods in Computer Science, 2022.
Warning: These citations may not always be 100% accurate.