Abstract
A new class of concurrent is constructed. These automata are extensions of pushdown automata and Petri nets. They lie properly between ordinary Petri nets and Turing machines. In the September 1977 issue of Computing survey James Peterson states that Any significant extension of the Petri net model tends to be equivalent to a Turing machine. This paper settled his conjecture negatively. The formal languages that are accepted/reconized by this automata lie properly between context free languages and context sensitive languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
