Almost sure termination is decidable for bounded-exponential PHORS because their generating functions under weighted relational semantics are always algebraic.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
other 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
A 2D neural cellular automaton spontaneously self-organizes into a Proto-CKY representation that exhibits syntactic processing capabilities for context-free grammars when trained on membership problems.
citing papers explorer
-
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Almost sure termination is decidable for bounded-exponential PHORS because their generating functions under weighted relational semantics are always algebraic.
-
On the Emergence of Syntax by Means of Local Interaction
A 2D neural cellular automaton spontaneously self-organizes into a Proto-CKY representation that exhibits syntactic processing capabilities for context-free grammars when trained on membership problems.