Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Filtered-popping_recursive_transition_network> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Filtered-popping_recursive_transition_network abstract "A filtered-popping recursive transition network (FPRTN), or simply filtered-popping network (FPN), is a recursive transition network (RTN) extended with a map of states to keys where returning from a subroutine jump requires the acceptor and return states to be mapped to the same key. RTNs are finite-state machines that can be seen as finite-state automata extended with a stack of return states; as well as consuming transitions and -transitions, RTNs may define call transitions. These transitions perform a subroutine 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 wikiPageID "24515308".
- Filtered-popping_recursive_transition_network wikiPageRevisionID "440716439".
- Filtered-popping_recursive_transition_network hasPhotoCollection Filtered-popping_recursive_transition_network.
- Filtered-popping_recursive_transition_network subject Category:Computational_linguistics.
- Filtered-popping_recursive_transition_network subject Category:Natural_language_processing.
- Filtered-popping_recursive_transition_network comment "A filtered-popping recursive transition network (FPRTN), or simply filtered-popping network (FPN), is a recursive transition network (RTN) extended with a map of states to keys where returning from a subroutine jump requires the acceptor and return states to be mapped to the same key. RTNs are finite-state machines that can be seen as finite-state automata extended with a stack of return states; as well as consuming transitions and -transitions, RTNs may define call transitions.".
- Filtered-popping_recursive_transition_network label "Filtered-popping recursive transition network".
- Filtered-popping_recursive_transition_network sameAs m.0809nhg.
- Filtered-popping_recursive_transition_network sameAs Q5449238.
- Filtered-popping_recursive_transition_network sameAs Q5449238.
- Filtered-popping_recursive_transition_network wasDerivedFrom Filtered-popping_recursive_transition_network?oldid=440716439.
- Filtered-popping_recursive_transition_network isPrimaryTopicOf Filtered-popping_recursive_transition_network.