2 papers
cs.FL2026
Contributions to the hierarchy of probabilistic languages
Lothar Sebastian Krapp, Remo Nitschke
We reconsider the theory of probabilistic formal languages generated by n-gram models and by probabilistic context-free grammars (PCFGs). The expected hierarchy of probabilistic gr…
eess.SP2025
Time-series Random Process Complexity Ranking Using a Bound on Conditional Differential Entropy
Jacob Ayers, Richard Hahnloser, Julia Ulrich +5
Conditional differential entropy provides an intuitive measure for relatively ranking time-series complexity by quantifying uncertainty in future observations given past context. H…