One FIFO place realizes zero-testing and Turing-machines.

For the most recent entries see the Petri Nets Newsletter.

One FIFO place realizes zero-testing and Turing-machines.

In: Petri Net Newsletter No. 51, pages 3-15. December 1996.

Abstract: In this paper, it is shown that a Petri net with only one FIFO place can simulate a Turing machine. Two different proofs are given. It is shown how any finite number of places can be tested on zero by using only one FIFO place, and a Petri net with only one FIFO place is constructed which simulates a given Turing machine.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography