Metraipolis › archive › dc_685b0ce74cf3
Filtered-popping recursive transition network — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:06:09.138Z
- SHA-256 of the archived text
6e351db43929bee6f65ca5d204a6abc6165ef15baeef0b5bf8088e62a837df89- Stable URL of this page
https://metraipolis.com/documento/dc_685b0ce74cf3
How to cite
Filtered-popping recursive transition network — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_685b0ce74cf3 (Metraipolis archive dc_685b0ce74cf3, sha256 6e351db43929bee6f65ca5d204a6abc6165ef15baeef0b5bf8088e62a837df89)
BibTeX
@misc{dc685b0ce74cf3,
title = {Filtered-popping recursive transition network — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_685b0ce74cf3; sha256 6e351db43929bee6f65ca5d204a6abc6165ef15baeef0b5bf8088e62a837df89},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 ε {\displaystyle \varepsilon } -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.
Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Natural language processing»).
Fonte: Wikipedia in inglese, voce «Filtered-popping recursive transition network» — https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network
Wikidata Q5449238 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5449238
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Filtered-popping_recursive_transition_network?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1046360514, consultata il 2026-10-05T23:01:05.462Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 970d194c1daf9b77e8b1590e0442666f43f3df219cfb986ae32cbb079d813ebf