Filtered-popping recursive transition network

A filtered-popping recursive transition network (FPRTN), or simply filtered-popping network (FPN), is a <a href="/facts/Recursive_transition_network/ok3pqpxs">recursive transition network</a> (<a href="/facts/Recursive_transition_network/ok3pqpxs">RTN</a>) extended with a map of states to keys where returning from a <a href="/facts/Subroutine/9vFJrg0A">subroutine</a> jump requires the acceptor and return states to be mapped to the same key. <a href="/facts/Recursive_transition_network/ok3pqpxs">RTNs</a> are <a href="/facts/Finite-state_machines/GMusWd0a">finite-state machines</a> that can be seen as <a href="/facts/Finite-state_automata/GMusWd0a">finite-state automata</a> extended with a <a href="/facts/Stack_(data_structure)/bj7l94v1">stack</a> of return states; as well as consuming transitions and 
 
 
 
 ε
 
 
 {\displaystyle \varepsilon }
 
-transitions, <a href="/facts/Recursive_transition_network/ok3pqpxs">RTNs</a> may define call transitions. These transitions perform a <a href="/facts/Subroutine/9vFJrg0A">subroutine</a> jump by pushing the transition's target state onto the stack and bringing the machine to the called state. Each time an acceptor state is reached, the return state at the top of the stack is popped out, provided that the stack is not empty, and the machine is brought to this state.
Throughout this article we refer to filtered-popping recursive transition networks as FPNs, though this acronym is ambiguous (e.g.: fuzzy Petri nets). Filtered-popping networks and FPRTNs are unambiguous alternatives.

Filtered-popping recursive transition network open-in-new

Filtered-popping recursive transition network